/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix048_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:43:06,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:43:06,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:43:06,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:43:06,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:43:06,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:43:06,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:43:06,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:43:06,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:43:06,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:43:06,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:43:06,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:43:06,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:43:06,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:43:06,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:43:06,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:43:06,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:43:06,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:43:06,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:43:06,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:43:06,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:43:06,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:43:06,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:43:06,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:43:06,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:43:06,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:43:06,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:43:06,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:43:06,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:43:06,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:43:06,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:43:06,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:43:06,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:43:06,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:43:06,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:43:06,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:43:06,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:43:06,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:43:06,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:43:06,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:43:06,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:43:06,810 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:43:06,824 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:43:06,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:43:06,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:43:06,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:43:06,826 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:43:06,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:43:06,826 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:43:06,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:43:06,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:43:06,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:43:06,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:43:06,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:43:06,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:43:06,828 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:43:06,828 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:43:06,828 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:43:06,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:43:06,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:43:06,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:43:06,829 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:43:06,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:43:06,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:43:06,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:43:06,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:43:06,830 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:43:06,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:43:06,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:43:06,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:43:06,831 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:43:06,831 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:43:07,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:43:07,105 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:43:07,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:43:07,113 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:43:07,113 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:43:07,114 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_pso.oepc.i [2019-12-18 13:43:07,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5198945/aae5197707414783bbad0e8f8e80a20e/FLAGfb6095048 [2019-12-18 13:43:07,800 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:43:07,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_pso.oepc.i [2019-12-18 13:43:07,826 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5198945/aae5197707414783bbad0e8f8e80a20e/FLAGfb6095048 [2019-12-18 13:43:08,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5198945/aae5197707414783bbad0e8f8e80a20e [2019-12-18 13:43:08,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:43:08,093 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:43:08,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:43:08,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:43:08,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:43:08,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:43:08" (1/1) ... [2019-12-18 13:43:08,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@217be98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:08, skipping insertion in model container [2019-12-18 13:43:08,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:43:08" (1/1) ... [2019-12-18 13:43:08,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:43:08,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:43:08,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:43:08,792 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:43:08,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:43:08,939 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:43:08,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:08 WrapperNode [2019-12-18 13:43:08,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:43:08,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:43:08,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:43:08,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:43:08,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:08" (1/1) ... [2019-12-18 13:43:08,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:08" (1/1) ... [2019-12-18 13:43:09,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:43:09,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:43:09,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:43:09,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:43:09,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:08" (1/1) ... [2019-12-18 13:43:09,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:08" (1/1) ... [2019-12-18 13:43:09,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:08" (1/1) ... [2019-12-18 13:43:09,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:08" (1/1) ... [2019-12-18 13:43:09,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:08" (1/1) ... [2019-12-18 13:43:09,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:08" (1/1) ... [2019-12-18 13:43:09,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:08" (1/1) ... [2019-12-18 13:43:09,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:43:09,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:43:09,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:43:09,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:43:09,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:43:09,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:43:09,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:43:09,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:43:09,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:43:09,127 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:43:09,127 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:43:09,127 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:43:09,127 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:43:09,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:43:09,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:43:09,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:43:09,129 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:43:09,830 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:43:09,830 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:43:09,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:43:09 BoogieIcfgContainer [2019-12-18 13:43:09,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:43:09,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:43:09,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:43:09,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:43:09,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:43:08" (1/3) ... [2019-12-18 13:43:09,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4c00c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:43:09, skipping insertion in model container [2019-12-18 13:43:09,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:08" (2/3) ... [2019-12-18 13:43:09,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4c00c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:43:09, skipping insertion in model container [2019-12-18 13:43:09,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:43:09" (3/3) ... [2019-12-18 13:43:09,841 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_pso.oepc.i [2019-12-18 13:43:09,851 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:43:09,852 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:43:09,860 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:43:09,861 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:43:09,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,900 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,900 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,900 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,901 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,901 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,911 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,912 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,971 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:09,992 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 13:43:10,021 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:43:10,022 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:43:10,022 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:43:10,022 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:43:10,022 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:43:10,023 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:43:10,023 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:43:10,023 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:43:10,049 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 13:43:10,052 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 13:43:10,169 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 13:43:10,169 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:43:10,189 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:43:10,209 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 13:43:10,284 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 13:43:10,284 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:43:10,290 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:43:10,306 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 13:43:10,307 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:43:15,119 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 13:43:15,292 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-18 13:43:15,292 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-18 13:43:15,295 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-18 13:43:15,712 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-18 13:43:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-18 13:43:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:43:15,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:15,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:43:15,723 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:15,730 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-18 13:43:15,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:15,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106957617] [2019-12-18 13:43:15,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:15,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106957617] [2019-12-18 13:43:15,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:15,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:43:15,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966479782] [2019-12-18 13:43:15,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:43:15,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:15,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:43:15,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:15,979 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-18 13:43:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:16,294 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-18 13:43:16,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:43:16,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:43:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:16,441 INFO L225 Difference]: With dead ends: 8074 [2019-12-18 13:43:16,441 INFO L226 Difference]: Without dead ends: 7606 [2019-12-18 13:43:16,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-18 13:43:16,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-18 13:43:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-18 13:43:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-18 13:43:16,976 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-18 13:43:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:16,977 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-18 13:43:16,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:43:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-18 13:43:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:43:16,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:16,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:43:16,985 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:16,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:16,986 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-18 13:43:16,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:16,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151517378] [2019-12-18 13:43:16,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:17,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151517378] [2019-12-18 13:43:17,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:17,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:43:17,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338660055] [2019-12-18 13:43:17,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:43:17,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:17,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:43:17,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:43:17,119 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-18 13:43:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:17,182 INFO L93 Difference]: Finished difference Result 1760 states and 4447 transitions. [2019-12-18 13:43:17,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:43:17,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:43:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:17,191 INFO L225 Difference]: With dead ends: 1760 [2019-12-18 13:43:17,191 INFO L226 Difference]: Without dead ends: 1292 [2019-12-18 13:43:17,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:43:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-18 13:43:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2019-12-18 13:43:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2019-12-18 13:43:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 2938 transitions. [2019-12-18 13:43:17,234 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 2938 transitions. Word has length 11 [2019-12-18 13:43:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:17,235 INFO L462 AbstractCegarLoop]: Abstraction has 1292 states and 2938 transitions. [2019-12-18 13:43:17,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:43:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2938 transitions. [2019-12-18 13:43:17,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:43:17,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:17,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:43:17,237 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:17,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:17,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-18 13:43:17,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:17,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017475728] [2019-12-18 13:43:17,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:17,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017475728] [2019-12-18 13:43:17,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:17,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:43:17,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117223896] [2019-12-18 13:43:17,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:43:17,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:17,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:43:17,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:43:17,378 INFO L87 Difference]: Start difference. First operand 1292 states and 2938 transitions. Second operand 5 states. [2019-12-18 13:43:17,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:17,667 INFO L93 Difference]: Finished difference Result 1855 states and 4087 transitions. [2019-12-18 13:43:17,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:43:17,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 13:43:17,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:17,678 INFO L225 Difference]: With dead ends: 1855 [2019-12-18 13:43:17,679 INFO L226 Difference]: Without dead ends: 1854 [2019-12-18 13:43:17,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:43:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-12-18 13:43:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1547. [2019-12-18 13:43:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-12-18 13:43:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 3457 transitions. [2019-12-18 13:43:17,732 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 3457 transitions. Word has length 14 [2019-12-18 13:43:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:17,736 INFO L462 AbstractCegarLoop]: Abstraction has 1547 states and 3457 transitions. [2019-12-18 13:43:17,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:43:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 3457 transitions. [2019-12-18 13:43:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 13:43:17,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:17,744 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] [2019-12-18 13:43:17,744 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:17,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:17,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-18 13:43:17,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:17,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701307820] [2019-12-18 13:43:17,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:17,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701307820] [2019-12-18 13:43:17,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:17,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:43:17,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540641857] [2019-12-18 13:43:17,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:43:17,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:17,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:43:17,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:43:17,900 INFO L87 Difference]: Start difference. First operand 1547 states and 3457 transitions. Second operand 6 states. [2019-12-18 13:43:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:18,337 INFO L93 Difference]: Finished difference Result 2337 states and 5001 transitions. [2019-12-18 13:43:18,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:43:18,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 13:43:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:18,351 INFO L225 Difference]: With dead ends: 2337 [2019-12-18 13:43:18,352 INFO L226 Difference]: Without dead ends: 2285 [2019-12-18 13:43:18,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:43:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2019-12-18 13:43:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1625. [2019-12-18 13:43:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2019-12-18 13:43:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 3604 transitions. [2019-12-18 13:43:18,411 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 3604 transitions. Word has length 24 [2019-12-18 13:43:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:18,411 INFO L462 AbstractCegarLoop]: Abstraction has 1625 states and 3604 transitions. [2019-12-18 13:43:18,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:43:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 3604 transitions. [2019-12-18 13:43:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:43:18,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:18,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:43:18,414 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2063536940, now seen corresponding path program 1 times [2019-12-18 13:43:18,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:18,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624103616] [2019-12-18 13:43:18,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:18,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624103616] [2019-12-18 13:43:18,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:18,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:43:18,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711636102] [2019-12-18 13:43:18,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:43:18,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:18,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:43:18,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:43:18,551 INFO L87 Difference]: Start difference. First operand 1625 states and 3604 transitions. Second operand 5 states. [2019-12-18 13:43:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:19,119 INFO L93 Difference]: Finished difference Result 2383 states and 5182 transitions. [2019-12-18 13:43:19,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:43:19,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 13:43:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:19,139 INFO L225 Difference]: With dead ends: 2383 [2019-12-18 13:43:19,140 INFO L226 Difference]: Without dead ends: 2383 [2019-12-18 13:43:19,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:43:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-18 13:43:19,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2084. [2019-12-18 13:43:19,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-12-18 13:43:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 4594 transitions. [2019-12-18 13:43:19,193 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 4594 transitions. Word has length 26 [2019-12-18 13:43:19,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:19,193 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 4594 transitions. [2019-12-18 13:43:19,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:43:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 4594 transitions. [2019-12-18 13:43:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:43:19,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:19,197 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] [2019-12-18 13:43:19,197 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-18 13:43:19,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:19,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132099938] [2019-12-18 13:43:19,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:19,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132099938] [2019-12-18 13:43:19,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:19,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:43:19,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602463028] [2019-12-18 13:43:19,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:43:19,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:19,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:43:19,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:43:19,277 INFO L87 Difference]: Start difference. First operand 2084 states and 4594 transitions. Second operand 5 states. [2019-12-18 13:43:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:19,326 INFO L93 Difference]: Finished difference Result 1286 states and 2707 transitions. [2019-12-18 13:43:19,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:43:19,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 13:43:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:19,338 INFO L225 Difference]: With dead ends: 1286 [2019-12-18 13:43:19,338 INFO L226 Difference]: Without dead ends: 1165 [2019-12-18 13:43:19,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:43:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-12-18 13:43:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1076. [2019-12-18 13:43:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-12-18 13:43:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 2287 transitions. [2019-12-18 13:43:19,369 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 2287 transitions. Word has length 27 [2019-12-18 13:43:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:19,370 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 2287 transitions. [2019-12-18 13:43:19,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:43:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 2287 transitions. [2019-12-18 13:43:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 13:43:19,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:19,376 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] [2019-12-18 13:43:19,376 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:19,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:19,376 INFO L82 PathProgramCache]: Analyzing trace with hash -44666522, now seen corresponding path program 1 times [2019-12-18 13:43:19,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:19,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325625376] [2019-12-18 13:43:19,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:19,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325625376] [2019-12-18 13:43:19,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:19,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:43:19,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511557630] [2019-12-18 13:43:19,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:43:19,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:19,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:43:19,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:43:19,510 INFO L87 Difference]: Start difference. First operand 1076 states and 2287 transitions. Second operand 4 states. [2019-12-18 13:43:19,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:19,530 INFO L93 Difference]: Finished difference Result 1807 states and 3865 transitions. [2019-12-18 13:43:19,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:43:19,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-18 13:43:19,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:19,535 INFO L225 Difference]: With dead ends: 1807 [2019-12-18 13:43:19,535 INFO L226 Difference]: Without dead ends: 800 [2019-12-18 13:43:19,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:43:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-12-18 13:43:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2019-12-18 13:43:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-18 13:43:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1708 transitions. [2019-12-18 13:43:19,552 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1708 transitions. Word has length 50 [2019-12-18 13:43:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:19,552 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1708 transitions. [2019-12-18 13:43:19,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:43:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1708 transitions. [2019-12-18 13:43:19,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 13:43:19,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:19,555 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] [2019-12-18 13:43:19,555 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:19,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1290466760, now seen corresponding path program 2 times [2019-12-18 13:43:19,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:19,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244036883] [2019-12-18 13:43:19,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:19,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244036883] [2019-12-18 13:43:19,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:19,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:43:19,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745562721] [2019-12-18 13:43:19,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:43:19,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:19,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:43:19,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:43:19,654 INFO L87 Difference]: Start difference. First operand 800 states and 1708 transitions. Second operand 7 states. [2019-12-18 13:43:19,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:19,877 INFO L93 Difference]: Finished difference Result 1394 states and 2892 transitions. [2019-12-18 13:43:19,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:43:19,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 13:43:19,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:19,881 INFO L225 Difference]: With dead ends: 1394 [2019-12-18 13:43:19,881 INFO L226 Difference]: Without dead ends: 931 [2019-12-18 13:43:19,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:43:19,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-18 13:43:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 792. [2019-12-18 13:43:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-18 13:43:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1676 transitions. [2019-12-18 13:43:19,899 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1676 transitions. Word has length 50 [2019-12-18 13:43:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:19,899 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1676 transitions. [2019-12-18 13:43:19,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:43:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1676 transitions. [2019-12-18 13:43:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 13:43:19,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:19,902 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] [2019-12-18 13:43:19,902 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:19,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:19,902 INFO L82 PathProgramCache]: Analyzing trace with hash 50774886, now seen corresponding path program 3 times [2019-12-18 13:43:19,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:19,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900191327] [2019-12-18 13:43:19,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:19,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900191327] [2019-12-18 13:43:19,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:19,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:43:19,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369609031] [2019-12-18 13:43:19,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:43:19,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:19,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:43:19,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:19,974 INFO L87 Difference]: Start difference. First operand 792 states and 1676 transitions. Second operand 3 states. [2019-12-18 13:43:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:20,022 INFO L93 Difference]: Finished difference Result 1051 states and 2216 transitions. [2019-12-18 13:43:20,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:43:20,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-18 13:43:20,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:20,027 INFO L225 Difference]: With dead ends: 1051 [2019-12-18 13:43:20,027 INFO L226 Difference]: Without dead ends: 1051 [2019-12-18 13:43:20,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:20,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-12-18 13:43:20,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 849. [2019-12-18 13:43:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-12-18 13:43:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1815 transitions. [2019-12-18 13:43:20,046 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1815 transitions. Word has length 50 [2019-12-18 13:43:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:20,046 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1815 transitions. [2019-12-18 13:43:20,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:43:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1815 transitions. [2019-12-18 13:43:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:43:20,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:20,049 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] [2019-12-18 13:43:20,049 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:20,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:20,049 INFO L82 PathProgramCache]: Analyzing trace with hash 925752847, now seen corresponding path program 1 times [2019-12-18 13:43:20,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:20,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563565552] [2019-12-18 13:43:20,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:20,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563565552] [2019-12-18 13:43:20,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:20,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:43:20,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551898967] [2019-12-18 13:43:20,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:43:20,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:20,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:43:20,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:43:20,172 INFO L87 Difference]: Start difference. First operand 849 states and 1815 transitions. Second operand 6 states. [2019-12-18 13:43:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:20,736 INFO L93 Difference]: Finished difference Result 1004 states and 2107 transitions. [2019-12-18 13:43:20,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:43:20,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-18 13:43:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:20,741 INFO L225 Difference]: With dead ends: 1004 [2019-12-18 13:43:20,742 INFO L226 Difference]: Without dead ends: 1004 [2019-12-18 13:43:20,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:43:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-12-18 13:43:20,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 909. [2019-12-18 13:43:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-18 13:43:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1931 transitions. [2019-12-18 13:43:20,760 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1931 transitions. Word has length 51 [2019-12-18 13:43:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:20,760 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1931 transitions. [2019-12-18 13:43:20,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:43:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1931 transitions. [2019-12-18 13:43:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:43:20,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:20,763 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] [2019-12-18 13:43:20,763 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:20,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:20,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1086861075, now seen corresponding path program 2 times [2019-12-18 13:43:20,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:20,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804941420] [2019-12-18 13:43:20,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:20,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804941420] [2019-12-18 13:43:20,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:20,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:43:20,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140815346] [2019-12-18 13:43:20,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:43:20,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:20,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:43:20,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:20,839 INFO L87 Difference]: Start difference. First operand 909 states and 1931 transitions. Second operand 3 states. [2019-12-18 13:43:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:20,865 INFO L93 Difference]: Finished difference Result 908 states and 1929 transitions. [2019-12-18 13:43:20,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:43:20,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 13:43:20,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:20,868 INFO L225 Difference]: With dead ends: 908 [2019-12-18 13:43:20,868 INFO L226 Difference]: Without dead ends: 908 [2019-12-18 13:43:20,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-12-18 13:43:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 754. [2019-12-18 13:43:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-18 13:43:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-18 13:43:20,884 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-18 13:43:20,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:20,884 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-18 13:43:20,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:43:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-18 13:43:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:43:20,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:20,887 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] [2019-12-18 13:43:20,888 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:20,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:20,888 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-18 13:43:20,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:20,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759213753] [2019-12-18 13:43:20,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:43:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:43:21,074 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:43:21,075 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:43:21,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= |v_ULTIMATE.start_main_~#t1285~0.offset_27| 0) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1285~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1285~0.base_40|) |v_ULTIMATE.start_main_~#t1285~0.offset_27| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1285~0.base_40| 4)) (= 0 v_~__unbuffered_p1_EAX~0_51) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1285~0.base_40| 1)) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1285~0.base_40|) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1285~0.base_40|) 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ULTIMATE.start_main_~#t1286~0.base=|v_ULTIMATE.start_main_~#t1286~0.base_41|, ULTIMATE.start_main_~#t1286~0.offset=|v_ULTIMATE.start_main_~#t1286~0.offset_27|, ~y~0=v_~y~0_133, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t1285~0.offset=|v_ULTIMATE.start_main_~#t1285~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ULTIMATE.start_main_~#t1285~0.base=|v_ULTIMATE.start_main_~#t1285~0.base_40|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1286~0.base, ULTIMATE.start_main_~#t1286~0.offset, ~y~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1285~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1285~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:43:21,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1286~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1286~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1286~0.base_13|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1286~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1286~0.base_13|) |v_ULTIMATE.start_main_~#t1286~0.offset_11| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1286~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1286~0.offset_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1286~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t1286~0.base=|v_ULTIMATE.start_main_~#t1286~0.base_13|, ULTIMATE.start_main_~#t1286~0.offset=|v_ULTIMATE.start_main_~#t1286~0.offset_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1286~0.base, ULTIMATE.start_main_~#t1286~0.offset, #length] because there is no mapped edge [2019-12-18 13:43:21,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~x~0_In-1553170192 ~__unbuffered_p0_EAX~0_Out-1553170192) (= ~y$r_buff1_thd2~0_Out-1553170192 ~y$r_buff0_thd2~0_In-1553170192) (= ~y$r_buff0_thd1~0_Out-1553170192 1) (= ~y$r_buff1_thd0~0_Out-1553170192 ~y$r_buff0_thd0~0_In-1553170192) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1553170192)) (= ~y$r_buff0_thd1~0_In-1553170192 ~y$r_buff1_thd1~0_Out-1553170192)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1553170192, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1553170192, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1553170192, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1553170192, ~x~0=~x~0_In-1553170192} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1553170192, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1553170192, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1553170192, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1553170192, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1553170192, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1553170192, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1553170192, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1553170192, ~x~0=~x~0_In-1553170192} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 13:43:21,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In214969232 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In214969232 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out214969232| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out214969232| ~y$w_buff0_used~0_In214969232) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In214969232, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In214969232} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out214969232|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In214969232, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In214969232} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:43:21,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-813572903 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-813572903| ~y$w_buff0_used~0_In-813572903) (= |P1Thread1of1ForFork1_#t~ite20_In-813572903| |P1Thread1of1ForFork1_#t~ite20_Out-813572903|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-813572903| ~y$w_buff0_used~0_In-813572903) (= |P1Thread1of1ForFork1_#t~ite20_Out-813572903| |P1Thread1of1ForFork1_#t~ite21_Out-813572903|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-813572903 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-813572903 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-813572903 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-813572903 256))))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-813572903, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-813572903, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-813572903|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-813572903, ~weak$$choice2~0=~weak$$choice2~0_In-813572903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-813572903} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-813572903, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-813572903, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-813572903|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-813572903, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-813572903|, ~weak$$choice2~0=~weak$$choice2~0_In-813572903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-813572903} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 13:43:21,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In672074375 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out672074375| |P1Thread1of1ForFork1_#t~ite23_Out672074375|)) (.cse0 (= (mod ~weak$$choice2~0_In672074375 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In672074375 256))) (.cse4 (= 0 (mod ~y$w_buff1_used~0_In672074375 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In672074375 256) 0))) (or (and (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out672074375| |P1Thread1of1ForFork1_#t~ite23_In672074375|) (= |P1Thread1of1ForFork1_#t~ite24_Out672074375| ~y$w_buff1_used~0_In672074375)) (and (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4)) (= |P1Thread1of1ForFork1_#t~ite23_Out672074375| ~y$w_buff1_used~0_In672074375) .cse5 .cse0)) (= |P1Thread1of1ForFork1_#t~ite22_In672074375| |P1Thread1of1ForFork1_#t~ite22_Out672074375|)) (let ((.cse6 (not .cse1))) (and (or .cse6 (not .cse2)) .cse5 .cse0 (not .cse3) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out672074375|) (or .cse6 (not .cse4)) (= |P1Thread1of1ForFork1_#t~ite23_Out672074375| |P1Thread1of1ForFork1_#t~ite22_Out672074375|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In672074375, ~y$w_buff0_used~0=~y$w_buff0_used~0_In672074375, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In672074375, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In672074375|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In672074375|, ~weak$$choice2~0=~weak$$choice2~0_In672074375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In672074375} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In672074375, ~y$w_buff0_used~0=~y$w_buff0_used~0_In672074375, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In672074375, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out672074375|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out672074375|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out672074375|, ~weak$$choice2~0=~weak$$choice2~0_In672074375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In672074375} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 13:43:21,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In960323346 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In960323346 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In960323346 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In960323346 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out960323346| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out960323346| ~y$w_buff1_used~0_In960323346) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In960323346, ~y$w_buff0_used~0=~y$w_buff0_used~0_In960323346, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In960323346, ~y$w_buff1_used~0=~y$w_buff1_used~0_In960323346} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out960323346|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In960323346, ~y$w_buff0_used~0=~y$w_buff0_used~0_In960323346, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In960323346, ~y$w_buff1_used~0=~y$w_buff1_used~0_In960323346} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:43:21,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1277041733 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1277041733 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-1277041733 0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In-1277041733 ~y$r_buff0_thd1~0_Out-1277041733) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1277041733, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1277041733} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1277041733, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1277041733|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1277041733} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:43:21,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1115481093 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1115481093 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1115481093 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1115481093 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1115481093|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd1~0_In1115481093 |P0Thread1of1ForFork0_#t~ite8_Out1115481093|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1115481093, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1115481093, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1115481093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1115481093} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1115481093, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1115481093, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1115481093|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1115481093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1115481093} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:43:21,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:43:21,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-425850966 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-425850966 |P1Thread1of1ForFork1_#t~ite29_Out-425850966|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-425850966 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-425850966 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-425850966 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In-425850966 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite30_Out-425850966| |P1Thread1of1ForFork1_#t~ite29_Out-425850966|)) (and (not .cse0) (= ~y$r_buff1_thd2~0_In-425850966 |P1Thread1of1ForFork1_#t~ite30_Out-425850966|) (= |P1Thread1of1ForFork1_#t~ite29_In-425850966| |P1Thread1of1ForFork1_#t~ite29_Out-425850966|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-425850966, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-425850966|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-425850966, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-425850966, ~weak$$choice2~0=~weak$$choice2~0_In-425850966, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-425850966} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-425850966, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-425850966|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-425850966|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-425850966, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-425850966, ~weak$$choice2~0=~weak$$choice2~0_In-425850966, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-425850966} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 13:43:21,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 13:43:21,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1750190985 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1750190985 256)))) (or (and (= ~y~0_In1750190985 |P1Thread1of1ForFork1_#t~ite32_Out1750190985|) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In1750190985 |P1Thread1of1ForFork1_#t~ite32_Out1750190985|) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1750190985, ~y$w_buff1~0=~y$w_buff1~0_In1750190985, ~y~0=~y~0_In1750190985, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1750190985} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1750190985, ~y$w_buff1~0=~y$w_buff1~0_In1750190985, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1750190985|, ~y~0=~y~0_In1750190985, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1750190985} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 13:43:21,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 13:43:21,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1149185253 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1149185253 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1149185253| ~y$w_buff0_used~0_In1149185253)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1149185253|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1149185253, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1149185253} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1149185253, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1149185253, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1149185253|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 13:43:21,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2140344584 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2140344584 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-2140344584 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-2140344584 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-2140344584| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-2140344584| ~y$w_buff1_used~0_In-2140344584) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2140344584, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2140344584, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2140344584, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2140344584} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2140344584, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2140344584, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2140344584, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2140344584|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2140344584} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 13:43:21,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1235988425 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1235988425 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1235988425| ~y$r_buff0_thd2~0_In-1235988425)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1235988425| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1235988425, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1235988425} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1235988425, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1235988425, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1235988425|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 13:43:21,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-1714069069 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1714069069 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1714069069 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1714069069 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1714069069| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out-1714069069| ~y$r_buff1_thd2~0_In-1714069069) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1714069069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1714069069, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1714069069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1714069069} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1714069069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1714069069, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1714069069, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1714069069|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1714069069} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:43:21,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:43:21,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:43:21,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:43:21,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1881393329 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1881393329 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1881393329| ~y$w_buff1~0_In-1881393329) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1881393329| ~y~0_In-1881393329)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1881393329, ~y~0=~y~0_In-1881393329, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1881393329, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1881393329} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1881393329|, ~y$w_buff1~0=~y$w_buff1~0_In-1881393329, ~y~0=~y~0_In-1881393329, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1881393329, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1881393329} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:43:21,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 13:43:21,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-654906409 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-654906409 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-654906409| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-654906409 |ULTIMATE.start_main_#t~ite42_Out-654906409|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-654906409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-654906409} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-654906409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-654906409, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-654906409|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:43:21,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1112479957 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1112479957 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1112479957 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1112479957 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1112479957 |ULTIMATE.start_main_#t~ite43_Out1112479957|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1112479957|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1112479957, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1112479957, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1112479957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1112479957} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1112479957, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1112479957, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1112479957|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1112479957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1112479957} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 13:43:21,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1659540188 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1659540188 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1659540188| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1659540188| ~y$r_buff0_thd0~0_In-1659540188) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1659540188, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1659540188} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1659540188, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1659540188, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1659540188|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:43:21,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1081450235 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1081450235 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1081450235 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1081450235 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1081450235| ~y$r_buff1_thd0~0_In1081450235) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out1081450235| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1081450235, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1081450235, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1081450235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1081450235} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1081450235, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1081450235, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1081450235, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1081450235|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1081450235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:43:21,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:43:21,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:43:21 BasicIcfg [2019-12-18 13:43:21,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:43:21,176 INFO L168 Benchmark]: Toolchain (without parser) took 13081.24 ms. Allocated memory was 141.0 MB in the beginning and 392.7 MB in the end (delta: 251.7 MB). Free memory was 101.0 MB in the beginning and 183.0 MB in the end (delta: -82.0 MB). Peak memory consumption was 169.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:21,177 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 141.0 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 13:43:21,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 846.11 ms. Allocated memory was 141.0 MB in the beginning and 201.9 MB in the end (delta: 60.8 MB). Free memory was 100.6 MB in the beginning and 156.6 MB in the end (delta: -56.0 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:21,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.01 ms. Allocated memory is still 201.9 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:21,179 INFO L168 Benchmark]: Boogie Preprocessor took 37.38 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:21,180 INFO L168 Benchmark]: RCFGBuilder took 785.53 ms. Allocated memory is still 201.9 MB. Free memory was 151.4 MB in the beginning and 107.2 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:21,181 INFO L168 Benchmark]: TraceAbstraction took 11338.86 ms. Allocated memory was 201.9 MB in the beginning and 392.7 MB in the end (delta: 190.8 MB). Free memory was 107.2 MB in the beginning and 183.0 MB in the end (delta: -75.9 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:21,185 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.25 ms. Allocated memory is still 141.0 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 846.11 ms. Allocated memory was 141.0 MB in the beginning and 201.9 MB in the end (delta: 60.8 MB). Free memory was 100.6 MB in the beginning and 156.6 MB in the end (delta: -56.0 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.01 ms. Allocated memory is still 201.9 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.38 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 785.53 ms. Allocated memory is still 201.9 MB. Free memory was 151.4 MB in the beginning and 107.2 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11338.86 ms. Allocated memory was 201.9 MB in the beginning and 392.7 MB in the end (delta: 190.8 MB). Free memory was 107.2 MB in the beginning and 183.0 MB in the end (delta: -75.9 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1285, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1286, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.0s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1347 SDtfs, 1418 SDslu, 2525 SDs, 0 SdLazy, 1450 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8220occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 1945 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 40998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...