/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/mix041_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:30:57,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:30:57,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:30:57,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:30:57,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:30:57,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:30:57,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:30:57,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:30:57,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:30:57,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:30:57,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:30:57,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:30:57,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:30:57,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:30:57,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:30:57,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:30:57,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:30:57,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:30:57,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:30:57,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:30:57,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:30:57,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:30:57,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:30:57,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:30:57,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:30:57,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:30:57,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:30:57,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:30:57,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:30:57,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:30:57,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:30:57,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:30:57,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:30:57,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:30:57,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:30:57,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:30:57,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:30:57,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:30:57,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:30:57,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:30:57,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:30:57,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:30:57,831 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:30:57,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:30:57,833 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:30:57,834 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:30:57,834 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:30:57,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:30:57,834 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:30:57,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:30:57,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:30:57,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:30:57,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:30:57,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:30:57,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:30:57,837 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:30:57,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:30:57,837 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:30:57,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:30:57,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:30:57,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:30:57,838 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:30:57,839 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:30:57,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:30:57,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:30:57,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:30:57,840 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:30:57,840 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:30:57,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:30:57,841 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:30:57,841 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:30:57,841 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:30:58,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:30:58,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:30:58,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:30:58,177 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:30:58,177 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:30:58,178 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_rmo.oepc.i [2019-12-18 13:30:58,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39beb6d05/b3016841ab494edcb77b5664b3cd0d3d/FLAG05c8b0868 [2019-12-18 13:30:58,801 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:30:58,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_rmo.oepc.i [2019-12-18 13:30:58,816 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39beb6d05/b3016841ab494edcb77b5664b3cd0d3d/FLAG05c8b0868 [2019-12-18 13:30:59,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39beb6d05/b3016841ab494edcb77b5664b3cd0d3d [2019-12-18 13:30:59,056 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:30:59,058 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:30:59,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:30:59,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:30:59,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:30:59,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:30:59" (1/1) ... [2019-12-18 13:30:59,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45be7259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:59, skipping insertion in model container [2019-12-18 13:30:59,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:30:59" (1/1) ... [2019-12-18 13:30:59,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:30:59,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:30:59,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:30:59,695 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:30:59,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:30:59,839 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:30:59,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:59 WrapperNode [2019-12-18 13:30:59,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:30:59,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:30:59,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:30:59,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:30:59,849 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:30:59" (1/1) ... [2019-12-18 13:30:59,869 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:30:59" (1/1) ... [2019-12-18 13:30:59,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:30:59,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:30:59,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:30:59,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:30:59,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:59" (1/1) ... [2019-12-18 13:30:59,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:59" (1/1) ... [2019-12-18 13:30:59,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:59" (1/1) ... [2019-12-18 13:30:59,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:59" (1/1) ... [2019-12-18 13:30:59,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:59" (1/1) ... [2019-12-18 13:30:59,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:59" (1/1) ... [2019-12-18 13:30:59,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:59" (1/1) ... [2019-12-18 13:30:59,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:30:59,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:30:59,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:30:59,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:30:59,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:59" (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:31:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:31:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:31:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:31:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:31:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:31:00,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:31:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:31:00,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:31:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:31:00,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:31:00,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:31:00,029 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:31:00,764 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:31:00,764 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:31:00,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:00 BoogieIcfgContainer [2019-12-18 13:31:00,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:31:00,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:31:00,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:31:00,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:31:00,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:30:59" (1/3) ... [2019-12-18 13:31:00,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464227b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:00, skipping insertion in model container [2019-12-18 13:31:00,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:59" (2/3) ... [2019-12-18 13:31:00,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464227b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:00, skipping insertion in model container [2019-12-18 13:31:00,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:00" (3/3) ... [2019-12-18 13:31:00,775 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_rmo.oepc.i [2019-12-18 13:31:00,786 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:31:00,786 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:31:00,797 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:31:00,798 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:31:00,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,856 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,856 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,856 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,857 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,857 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,867 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,867 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,916 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,917 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,917 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,923 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,925 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:00,941 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 13:31:00,961 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:31:00,961 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:31:00,961 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:31:00,962 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:31:00,962 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:31:00,962 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:31:00,962 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:31:00,962 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:31:00,978 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 13:31:00,981 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 13:31:01,054 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 13:31:01,055 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:01,068 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:31:01,088 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 13:31:01,126 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 13:31:01,126 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:01,134 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:31:01,148 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 13:31:01,149 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:31:04,038 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-18 13:31:05,597 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 13:31:05,710 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 13:31:06,167 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82827 [2019-12-18 13:31:06,168 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 13:31:06,172 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-18 13:31:06,690 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-18 13:31:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-18 13:31:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:31:06,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:06,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:31:06,701 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:31:06,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:06,707 INFO L82 PathProgramCache]: Analyzing trace with hash 792296, now seen corresponding path program 1 times [2019-12-18 13:31:06,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:06,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723349128] [2019-12-18 13:31:06,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:06,935 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:31:06,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723349128] [2019-12-18 13:31:06,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:06,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:31:06,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646433076] [2019-12-18 13:31:06,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:06,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:06,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:06,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:06,965 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-18 13:31:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:07,335 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-12-18 13:31:07,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:07,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:31:07,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:07,496 INFO L225 Difference]: With dead ends: 8506 [2019-12-18 13:31:07,496 INFO L226 Difference]: Without dead ends: 7522 [2019-12-18 13:31:07,498 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:31:07,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-12-18 13:31:07,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-12-18 13:31:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-12-18 13:31:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-12-18 13:31:07,910 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-12-18 13:31:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:07,910 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-12-18 13:31:07,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-12-18 13:31:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:31:07,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:07,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:07,914 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:31:07,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:07,915 INFO L82 PathProgramCache]: Analyzing trace with hash -476377294, now seen corresponding path program 1 times [2019-12-18 13:31:07,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:07,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405662417] [2019-12-18 13:31:07,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:08,039 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:31:08,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405662417] [2019-12-18 13:31:08,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:08,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:08,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459924850] [2019-12-18 13:31:08,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:08,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:08,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:08,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:08,044 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 3 states. [2019-12-18 13:31:08,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:08,095 INFO L93 Difference]: Finished difference Result 1232 states and 2827 transitions. [2019-12-18 13:31:08,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:08,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 13:31:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:08,104 INFO L225 Difference]: With dead ends: 1232 [2019-12-18 13:31:08,105 INFO L226 Difference]: Without dead ends: 1232 [2019-12-18 13:31:08,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-18 13:31:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-18 13:31:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-18 13:31:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2827 transitions. [2019-12-18 13:31:08,159 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2827 transitions. Word has length 11 [2019-12-18 13:31:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:08,160 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2827 transitions. [2019-12-18 13:31:08,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2827 transitions. [2019-12-18 13:31:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:31:08,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:08,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:08,170 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:31:08,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:08,171 INFO L82 PathProgramCache]: Analyzing trace with hash 394534895, now seen corresponding path program 1 times [2019-12-18 13:31:08,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:08,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768024284] [2019-12-18 13:31:08,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:08,267 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:31:08,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768024284] [2019-12-18 13:31:08,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:08,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:08,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643694159] [2019-12-18 13:31:08,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:08,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:08,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:08,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:08,270 INFO L87 Difference]: Start difference. First operand 1232 states and 2827 transitions. Second operand 3 states. [2019-12-18 13:31:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:08,354 INFO L93 Difference]: Finished difference Result 1960 states and 4354 transitions. [2019-12-18 13:31:08,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:08,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 13:31:08,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:08,366 INFO L225 Difference]: With dead ends: 1960 [2019-12-18 13:31:08,366 INFO L226 Difference]: Without dead ends: 1960 [2019-12-18 13:31:08,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2019-12-18 13:31:08,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1384. [2019-12-18 13:31:08,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2019-12-18 13:31:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3137 transitions. [2019-12-18 13:31:08,409 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3137 transitions. Word has length 14 [2019-12-18 13:31:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:08,409 INFO L462 AbstractCegarLoop]: Abstraction has 1384 states and 3137 transitions. [2019-12-18 13:31:08,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3137 transitions. [2019-12-18 13:31:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:31:08,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:08,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:08,411 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:31:08,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:08,412 INFO L82 PathProgramCache]: Analyzing trace with hash 304327747, now seen corresponding path program 1 times [2019-12-18 13:31:08,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:08,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023115370] [2019-12-18 13:31:08,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:08,506 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:31:08,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023115370] [2019-12-18 13:31:08,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:08,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:08,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820179102] [2019-12-18 13:31:08,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:31:08,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:08,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:31:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:08,510 INFO L87 Difference]: Start difference. First operand 1384 states and 3137 transitions. Second operand 4 states. [2019-12-18 13:31:08,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:08,735 INFO L93 Difference]: Finished difference Result 1706 states and 3795 transitions. [2019-12-18 13:31:08,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:31:08,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:31:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:08,745 INFO L225 Difference]: With dead ends: 1706 [2019-12-18 13:31:08,745 INFO L226 Difference]: Without dead ends: 1706 [2019-12-18 13:31:08,746 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:31:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-12-18 13:31:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1646. [2019-12-18 13:31:08,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-12-18 13:31:08,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 3679 transitions. [2019-12-18 13:31:08,837 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 3679 transitions. Word has length 14 [2019-12-18 13:31:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:08,837 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 3679 transitions. [2019-12-18 13:31:08,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:31:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 3679 transitions. [2019-12-18 13:31:08,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:31:08,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:08,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:08,838 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:31:08,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:08,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1071051512, now seen corresponding path program 1 times [2019-12-18 13:31:08,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:08,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57167723] [2019-12-18 13:31:08,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:08,952 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:31:08,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57167723] [2019-12-18 13:31:08,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:08,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:08,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000810704] [2019-12-18 13:31:08,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:31:08,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:08,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:31:08,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:08,955 INFO L87 Difference]: Start difference. First operand 1646 states and 3679 transitions. Second operand 4 states. [2019-12-18 13:31:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:09,182 INFO L93 Difference]: Finished difference Result 2032 states and 4499 transitions. [2019-12-18 13:31:09,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:31:09,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:31:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:09,195 INFO L225 Difference]: With dead ends: 2032 [2019-12-18 13:31:09,195 INFO L226 Difference]: Without dead ends: 2032 [2019-12-18 13:31:09,195 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:31:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-12-18 13:31:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1750. [2019-12-18 13:31:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-12-18 13:31:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 3922 transitions. [2019-12-18 13:31:09,240 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 3922 transitions. Word has length 14 [2019-12-18 13:31:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:09,240 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 3922 transitions. [2019-12-18 13:31:09,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:31:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3922 transitions. [2019-12-18 13:31:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:31:09,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:09,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:09,243 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:31:09,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:09,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1681809556, now seen corresponding path program 1 times [2019-12-18 13:31:09,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:09,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934016909] [2019-12-18 13:31:09,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:09,431 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:31:09,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934016909] [2019-12-18 13:31:09,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:09,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:09,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308309435] [2019-12-18 13:31:09,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:09,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:09,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:09,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:09,435 INFO L87 Difference]: Start difference. First operand 1750 states and 3922 transitions. Second operand 5 states. [2019-12-18 13:31:09,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:09,721 INFO L93 Difference]: Finished difference Result 2284 states and 4985 transitions. [2019-12-18 13:31:09,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:31:09,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 13:31:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:09,735 INFO L225 Difference]: With dead ends: 2284 [2019-12-18 13:31:09,735 INFO L226 Difference]: Without dead ends: 2284 [2019-12-18 13:31:09,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:31:09,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2019-12-18 13:31:09,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2035. [2019-12-18 13:31:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-18 13:31:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4506 transitions. [2019-12-18 13:31:09,785 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4506 transitions. Word has length 25 [2019-12-18 13:31:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:09,785 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4506 transitions. [2019-12-18 13:31:09,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4506 transitions. [2019-12-18 13:31:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:31:09,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:09,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:09,789 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:31:09,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:09,789 INFO L82 PathProgramCache]: Analyzing trace with hash 968997935, now seen corresponding path program 1 times [2019-12-18 13:31:09,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:09,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458798957] [2019-12-18 13:31:09,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:09,832 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:31:09,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458798957] [2019-12-18 13:31:09,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:09,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:09,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398582347] [2019-12-18 13:31:09,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:09,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:09,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:09,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:09,835 INFO L87 Difference]: Start difference. First operand 2035 states and 4506 transitions. Second operand 3 states. [2019-12-18 13:31:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:09,885 INFO L93 Difference]: Finished difference Result 2578 states and 5509 transitions. [2019-12-18 13:31:09,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:09,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 13:31:09,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:09,893 INFO L225 Difference]: With dead ends: 2578 [2019-12-18 13:31:09,893 INFO L226 Difference]: Without dead ends: 2578 [2019-12-18 13:31:09,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-12-18 13:31:09,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1993. [2019-12-18 13:31:09,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-12-18 13:31:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 4274 transitions. [2019-12-18 13:31:09,948 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 4274 transitions. Word has length 25 [2019-12-18 13:31:09,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:09,948 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 4274 transitions. [2019-12-18 13:31:09,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 4274 transitions. [2019-12-18 13:31:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:31:09,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:09,951 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:31:09,951 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:31:09,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:09,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1274554926, now seen corresponding path program 1 times [2019-12-18 13:31:09,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:09,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828416532] [2019-12-18 13:31:09,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:10,003 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:31:10,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828416532] [2019-12-18 13:31:10,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:10,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:10,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923534041] [2019-12-18 13:31:10,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:10,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:10,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:10,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:10,005 INFO L87 Difference]: Start difference. First operand 1993 states and 4274 transitions. Second operand 3 states. [2019-12-18 13:31:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:10,025 INFO L93 Difference]: Finished difference Result 3111 states and 6741 transitions. [2019-12-18 13:31:10,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:10,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 13:31:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:10,029 INFO L225 Difference]: With dead ends: 3111 [2019-12-18 13:31:10,030 INFO L226 Difference]: Without dead ends: 1431 [2019-12-18 13:31:10,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-18 13:31:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1411. [2019-12-18 13:31:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-12-18 13:31:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2997 transitions. [2019-12-18 13:31:10,076 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2997 transitions. Word has length 26 [2019-12-18 13:31:10,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:10,077 INFO L462 AbstractCegarLoop]: Abstraction has 1411 states and 2997 transitions. [2019-12-18 13:31:10,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2997 transitions. [2019-12-18 13:31:10,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:31:10,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:10,079 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:31:10,079 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:31:10,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:10,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1286104553, now seen corresponding path program 1 times [2019-12-18 13:31:10,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:10,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853323897] [2019-12-18 13:31:10,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:10,202 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:31:10,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853323897] [2019-12-18 13:31:10,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:10,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:31:10,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378932781] [2019-12-18 13:31:10,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:10,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:10,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:10,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:10,206 INFO L87 Difference]: Start difference. First operand 1411 states and 2997 transitions. Second operand 5 states. [2019-12-18 13:31:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:10,262 INFO L93 Difference]: Finished difference Result 1459 states and 3091 transitions. [2019-12-18 13:31:10,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:31:10,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 13:31:10,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:10,268 INFO L225 Difference]: With dead ends: 1459 [2019-12-18 13:31:10,268 INFO L226 Difference]: Without dead ends: 1459 [2019-12-18 13:31:10,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2019-12-18 13:31:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1459. [2019-12-18 13:31:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-12-18 13:31:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 3091 transitions. [2019-12-18 13:31:10,306 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 3091 transitions. Word has length 26 [2019-12-18 13:31:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:10,307 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 3091 transitions. [2019-12-18 13:31:10,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 3091 transitions. [2019-12-18 13:31:10,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:31:10,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:10,311 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:31:10,312 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:31:10,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:10,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1349237224, now seen corresponding path program 1 times [2019-12-18 13:31:10,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:10,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661131722] [2019-12-18 13:31:10,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:10,405 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:31:10,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661131722] [2019-12-18 13:31:10,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:10,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:31:10,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515963866] [2019-12-18 13:31:10,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:10,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:10,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:10,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:10,409 INFO L87 Difference]: Start difference. First operand 1459 states and 3091 transitions. Second operand 5 states. [2019-12-18 13:31:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:10,903 INFO L93 Difference]: Finished difference Result 2307 states and 4819 transitions. [2019-12-18 13:31:10,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:31:10,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 13:31:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:10,910 INFO L225 Difference]: With dead ends: 2307 [2019-12-18 13:31:10,910 INFO L226 Difference]: Without dead ends: 2307 [2019-12-18 13:31:10,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:31:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-12-18 13:31:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2095. [2019-12-18 13:31:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2095 states. [2019-12-18 13:31:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 4411 transitions. [2019-12-18 13:31:10,958 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 4411 transitions. Word has length 27 [2019-12-18 13:31:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:10,958 INFO L462 AbstractCegarLoop]: Abstraction has 2095 states and 4411 transitions. [2019-12-18 13:31:10,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 4411 transitions. [2019-12-18 13:31:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:31:10,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:10,962 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:31:10,962 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:31:10,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:10,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1627795246, now seen corresponding path program 1 times [2019-12-18 13:31:10,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:10,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955563669] [2019-12-18 13:31:10,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:11,032 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:31:11,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955563669] [2019-12-18 13:31:11,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:11,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:11,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436923046] [2019-12-18 13:31:11,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:11,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:11,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:11,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:11,034 INFO L87 Difference]: Start difference. First operand 2095 states and 4411 transitions. Second operand 5 states. [2019-12-18 13:31:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:11,179 INFO L93 Difference]: Finished difference Result 2100 states and 4402 transitions. [2019-12-18 13:31:11,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:31:11,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 13:31:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:11,185 INFO L225 Difference]: With dead ends: 2100 [2019-12-18 13:31:11,185 INFO L226 Difference]: Without dead ends: 2100 [2019-12-18 13:31:11,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:31:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-12-18 13:31:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2063. [2019-12-18 13:31:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2019-12-18 13:31:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 4347 transitions. [2019-12-18 13:31:11,226 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 4347 transitions. Word has length 27 [2019-12-18 13:31:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:11,227 INFO L462 AbstractCegarLoop]: Abstraction has 2063 states and 4347 transitions. [2019-12-18 13:31:11,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 4347 transitions. [2019-12-18 13:31:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:31:11,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:11,230 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] [2019-12-18 13:31:11,231 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:31:11,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:11,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1804230119, now seen corresponding path program 1 times [2019-12-18 13:31:11,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:11,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838760677] [2019-12-18 13:31:11,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:11,273 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:31:11,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838760677] [2019-12-18 13:31:11,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:11,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:11,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528106775] [2019-12-18 13:31:11,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:31:11,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:11,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:31:11,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:11,275 INFO L87 Difference]: Start difference. First operand 2063 states and 4347 transitions. Second operand 4 states. [2019-12-18 13:31:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:11,291 INFO L93 Difference]: Finished difference Result 1156 states and 2299 transitions. [2019-12-18 13:31:11,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:31:11,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 13:31:11,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:11,294 INFO L225 Difference]: With dead ends: 1156 [2019-12-18 13:31:11,294 INFO L226 Difference]: Without dead ends: 1041 [2019-12-18 13:31:11,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:11,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-12-18 13:31:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 969. [2019-12-18 13:31:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-12-18 13:31:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 2002 transitions. [2019-12-18 13:31:11,316 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 2002 transitions. Word has length 28 [2019-12-18 13:31:11,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:11,316 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 2002 transitions. [2019-12-18 13:31:11,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:31:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 2002 transitions. [2019-12-18 13:31:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:31:11,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:11,319 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:31:11,319 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:11,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:11,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1370475912, now seen corresponding path program 1 times [2019-12-18 13:31:11,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:11,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452180767] [2019-12-18 13:31:11,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:11,414 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:31:11,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452180767] [2019-12-18 13:31:11,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:11,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:31:11,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444291009] [2019-12-18 13:31:11,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:31:11,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:11,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:31:11,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:31:11,416 INFO L87 Difference]: Start difference. First operand 969 states and 2002 transitions. Second operand 7 states. [2019-12-18 13:31:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:11,609 INFO L93 Difference]: Finished difference Result 1685 states and 3392 transitions. [2019-12-18 13:31:11,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:31:11,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 13:31:11,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:11,614 INFO L225 Difference]: With dead ends: 1685 [2019-12-18 13:31:11,615 INFO L226 Difference]: Without dead ends: 1116 [2019-12-18 13:31:11,615 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:31:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-12-18 13:31:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 969. [2019-12-18 13:31:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-12-18 13:31:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1976 transitions. [2019-12-18 13:31:11,636 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1976 transitions. Word has length 51 [2019-12-18 13:31:11,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:11,637 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 1976 transitions. [2019-12-18 13:31:11,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:31:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1976 transitions. [2019-12-18 13:31:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:31:11,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:11,640 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:31:11,640 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:11,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:11,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1368511210, now seen corresponding path program 2 times [2019-12-18 13:31:11,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:11,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793256882] [2019-12-18 13:31:11,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:11,741 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:31:11,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793256882] [2019-12-18 13:31:11,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:11,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:31:11,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341444067] [2019-12-18 13:31:11,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:31:11,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:11,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:31:11,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:31:11,743 INFO L87 Difference]: Start difference. First operand 969 states and 1976 transitions. Second operand 6 states. [2019-12-18 13:31:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:12,288 INFO L93 Difference]: Finished difference Result 1128 states and 2278 transitions. [2019-12-18 13:31:12,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:31:12,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-18 13:31:12,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:12,291 INFO L225 Difference]: With dead ends: 1128 [2019-12-18 13:31:12,291 INFO L226 Difference]: Without dead ends: 1128 [2019-12-18 13:31:12,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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:31:12,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-12-18 13:31:12,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 999. [2019-12-18 13:31:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-12-18 13:31:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 2031 transitions. [2019-12-18 13:31:12,313 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 2031 transitions. Word has length 51 [2019-12-18 13:31:12,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:12,313 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 2031 transitions. [2019-12-18 13:31:12,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:31:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 2031 transitions. [2019-12-18 13:31:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:31:12,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:12,316 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:31:12,316 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:12,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:12,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1240455298, now seen corresponding path program 3 times [2019-12-18 13:31:12,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:12,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259364455] [2019-12-18 13:31:12,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:12,399 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:31:12,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259364455] [2019-12-18 13:31:12,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:12,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:31:12,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470566328] [2019-12-18 13:31:12,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:12,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:12,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:12,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:12,401 INFO L87 Difference]: Start difference. First operand 999 states and 2031 transitions. Second operand 5 states. [2019-12-18 13:31:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:12,614 INFO L93 Difference]: Finished difference Result 1128 states and 2264 transitions. [2019-12-18 13:31:12,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:31:12,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-18 13:31:12,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:12,617 INFO L225 Difference]: With dead ends: 1128 [2019-12-18 13:31:12,617 INFO L226 Difference]: Without dead ends: 1128 [2019-12-18 13:31:12,618 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:31:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-12-18 13:31:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1040. [2019-12-18 13:31:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-12-18 13:31:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 2111 transitions. [2019-12-18 13:31:12,640 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 2111 transitions. Word has length 51 [2019-12-18 13:31:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:12,641 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 2111 transitions. [2019-12-18 13:31:12,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:12,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 2111 transitions. [2019-12-18 13:31:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:31:12,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:12,644 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:31:12,644 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:12,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:12,645 INFO L82 PathProgramCache]: Analyzing trace with hash 503151608, now seen corresponding path program 4 times [2019-12-18 13:31:12,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:12,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936484901] [2019-12-18 13:31:12,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:12,755 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:31:12,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936484901] [2019-12-18 13:31:12,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:12,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:12,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535173402] [2019-12-18 13:31:12,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:12,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:12,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:12,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:12,757 INFO L87 Difference]: Start difference. First operand 1040 states and 2111 transitions. Second operand 3 states. [2019-12-18 13:31:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:12,774 INFO L93 Difference]: Finished difference Result 1040 states and 2110 transitions. [2019-12-18 13:31:12,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:12,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 13:31:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:12,777 INFO L225 Difference]: With dead ends: 1040 [2019-12-18 13:31:12,777 INFO L226 Difference]: Without dead ends: 1040 [2019-12-18 13:31:12,777 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:31:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-12-18 13:31:12,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 929. [2019-12-18 13:31:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-12-18 13:31:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1907 transitions. [2019-12-18 13:31:12,795 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1907 transitions. Word has length 51 [2019-12-18 13:31:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:12,795 INFO L462 AbstractCegarLoop]: Abstraction has 929 states and 1907 transitions. [2019-12-18 13:31:12,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1907 transitions. [2019-12-18 13:31:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:31:12,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:12,798 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:31:12,799 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:12,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:12,799 INFO L82 PathProgramCache]: Analyzing trace with hash -480319677, now seen corresponding path program 1 times [2019-12-18 13:31:12,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:12,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782014397] [2019-12-18 13:31:12,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:12,909 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:31:12,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782014397] [2019-12-18 13:31:12,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:12,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:31:12,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558703500] [2019-12-18 13:31:12,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:12,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:12,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:12,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:12,911 INFO L87 Difference]: Start difference. First operand 929 states and 1907 transitions. Second operand 5 states. [2019-12-18 13:31:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:12,968 INFO L93 Difference]: Finished difference Result 1057 states and 2161 transitions. [2019-12-18 13:31:12,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:12,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 13:31:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:12,970 INFO L225 Difference]: With dead ends: 1057 [2019-12-18 13:31:12,971 INFO L226 Difference]: Without dead ends: 1057 [2019-12-18 13:31:12,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-12-18 13:31:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 841. [2019-12-18 13:31:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-12-18 13:31:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1735 transitions. [2019-12-18 13:31:12,987 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1735 transitions. Word has length 52 [2019-12-18 13:31:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:12,987 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1735 transitions. [2019-12-18 13:31:12,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1735 transitions. [2019-12-18 13:31:12,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:31:12,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:12,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:12,990 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:12,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:12,990 INFO L82 PathProgramCache]: Analyzing trace with hash -409769665, now seen corresponding path program 1 times [2019-12-18 13:31:12,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:12,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450760284] [2019-12-18 13:31:12,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:31:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:31:13,099 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:31:13,100 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:31:13,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= v_~z$mem_tmp~0_25 0) (= v_~y~0_23 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1097~0.base_27| 1)) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_98 0) (= v_~main$tmp_guard1~0_44 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1097~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1097~0.base_27|) |v_ULTIMATE.start_main_~#t1097~0.offset_19| 0)) |v_#memory_int_11|) (= v_~z$w_buff1~0_160 0) (= 0 v_~weak$$choice0~0_23) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$r_buff0_thd1~0_174 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1097~0.base_27|)) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_45) (= v_~z$w_buff0~0_252 0) (= v_~z~0_120 0) (= v_~z$r_buff0_thd0~0_134 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~main$tmp_guard0~0_20 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_33) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1097~0.base_27|) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_196 0) (= v_~z$r_buff1_thd0~0_144 0) (= 0 v_~weak$$choice2~0_99) (= v_~z$w_buff0_used~0_606 0) (= |v_ULTIMATE.start_main_~#t1097~0.offset_19| 0) (= v_~z$w_buff1_used~0_306 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1097~0.base_27| 4)) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$r_buff0_thd2~0_279 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_196, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_160, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_370|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_93|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, #length=|v_#length_17|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_279, ULTIMATE.start_main_~#t1098~0.offset=|v_ULTIMATE.start_main_~#t1098~0.offset_14|, ~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_606, ~z$w_buff0~0=v_~z$w_buff0~0_252, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_306, ~z$flush_delayed~0=v_~z$flush_delayed~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_~#t1097~0.base=|v_ULTIMATE.start_main_~#t1097~0.base_27|, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_23, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_58|, ULTIMATE.start_main_~#t1098~0.base=|v_ULTIMATE.start_main_~#t1098~0.base_22|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~z~0=v_~z~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ULTIMATE.start_main_~#t1097~0.offset=|v_ULTIMATE.start_main_~#t1097~0.offset_19|, ~x~0=v_~x~0_98} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1098~0.offset, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1097~0.base, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t1098~0.base, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1097~0.offset, ~x~0] because there is no mapped edge [2019-12-18 13:31:13,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~z$r_buff0_thd0~0_In581022445 ~z$r_buff1_thd0~0_Out581022445) (= ~z$r_buff0_thd1~0_In581022445 ~z$r_buff1_thd1~0_Out581022445) (= ~x~0_Out581022445 1) (= ~z$r_buff1_thd2~0_Out581022445 ~z$r_buff0_thd2~0_In581022445) (= 1 ~z$r_buff0_thd1~0_Out581022445) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In581022445))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In581022445, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In581022445, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In581022445, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In581022445} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In581022445, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out581022445, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out581022445, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out581022445, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In581022445, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out581022445, ~x~0=~x~0_Out581022445, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In581022445} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 13:31:13,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L802-1-->L804: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1098~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1098~0.base_11| 0)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1098~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1098~0.base_11|) |v_ULTIMATE.start_main_~#t1098~0.offset_10| 1)) |v_#memory_int_5|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1098~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1098~0.base_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1098~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t1098~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1098~0.offset=|v_ULTIMATE.start_main_~#t1098~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1098~0.base=|v_ULTIMATE.start_main_~#t1098~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1098~0.offset, ULTIMATE.start_main_~#t1098~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 13:31:13,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1146368862 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1146368862 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1146368862|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1146368862 |P0Thread1of1ForFork0_#t~ite5_Out1146368862|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1146368862, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1146368862} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1146368862|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1146368862, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1146368862} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:31:13,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd1~0_In2121593893 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2121593893 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2121593893 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In2121593893 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In2121593893 |P0Thread1of1ForFork0_#t~ite6_Out2121593893|) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out2121593893| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2121593893, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2121593893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2121593893, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2121593893} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2121593893|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2121593893, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2121593893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2121593893, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2121593893} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:31:13,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In653273245 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In653273245 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out653273245 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In653273245 ~z$r_buff0_thd1~0_Out653273245) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In653273245, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In653273245} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In653273245, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out653273245|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out653273245} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:31:13,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1427539613 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-1427539613 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1427539613 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1427539613 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1427539613| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1427539613| ~z$r_buff1_thd1~0_In-1427539613) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1427539613, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1427539613, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1427539613, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1427539613} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1427539613, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1427539613|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1427539613, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1427539613, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1427539613} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:31:13,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:31:13,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd2~0_61 v_~z$r_buff0_thd2~0_60)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_61} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 13:31:13,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1719828815 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out1719828815| |P1Thread1of1ForFork1_#t~ite29_Out1719828815|) (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1719828815 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1719828815 256)) (and (= (mod ~z$w_buff1_used~0_In1719828815 256) 0) .cse0) (and (= (mod ~z$r_buff1_thd2~0_In1719828815 256) 0) .cse0))) (= ~z$r_buff1_thd2~0_In1719828815 |P1Thread1of1ForFork1_#t~ite29_Out1719828815|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite30_Out1719828815| ~z$r_buff1_thd2~0_In1719828815) (= |P1Thread1of1ForFork1_#t~ite29_In1719828815| |P1Thread1of1ForFork1_#t~ite29_Out1719828815|) (not .cse1)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1719828815|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1719828815, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1719828815, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1719828815, ~weak$$choice2~0=~weak$$choice2~0_In1719828815, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1719828815} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1719828815|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1719828815|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1719828815, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1719828815, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1719828815, ~weak$$choice2~0=~weak$$choice2~0_In1719828815, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1719828815} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 13:31:13,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~z~0_27 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_8) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 13:31:13,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-2018325148 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2018325148 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-2018325148 |P1Thread1of1ForFork1_#t~ite32_Out-2018325148|)) (and (= ~z$w_buff1~0_In-2018325148 |P1Thread1of1ForFork1_#t~ite32_Out-2018325148|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2018325148, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2018325148, ~z$w_buff1~0=~z$w_buff1~0_In-2018325148, ~z~0=~z~0_In-2018325148} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2018325148, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2018325148, ~z$w_buff1~0=~z$w_buff1~0_In-2018325148, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-2018325148|, ~z~0=~z~0_In-2018325148} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 13:31:13,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_39 |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|, ~z~0=v_~z~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-12-18 13:31:13,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1631851185 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1631851185 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1631851185| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1631851185| ~z$w_buff0_used~0_In1631851185) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1631851185, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1631851185} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1631851185, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1631851185|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1631851185} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 13:31:13,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-1822871901 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1822871901 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1822871901 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1822871901 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1822871901 |P1Thread1of1ForFork1_#t~ite35_Out-1822871901|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1822871901|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1822871901, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1822871901, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1822871901, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1822871901} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1822871901, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1822871901, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1822871901, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1822871901|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1822871901} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 13:31:13,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1282895164 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1282895164 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1282895164| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1282895164| ~z$r_buff0_thd2~0_In1282895164)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1282895164, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1282895164} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1282895164, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1282895164, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1282895164|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 13:31:13,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1900850147 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1900850147 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1900850147 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1900850147 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1900850147| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out-1900850147| ~z$r_buff1_thd2~0_In-1900850147)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1900850147, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1900850147, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1900850147, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1900850147} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1900850147, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1900850147, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1900850147, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1900850147, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1900850147|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:31:13,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite37_24| v_~z$r_buff1_thd2~0_88) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_88, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:31:13,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_16)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 13:31:13,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-2040396991 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2040396991 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite41_Out-2040396991| |ULTIMATE.start_main_#t~ite40_Out-2040396991|))) (or (and (= ~z$w_buff1~0_In-2040396991 |ULTIMATE.start_main_#t~ite40_Out-2040396991|) .cse0 (not .cse1) (not .cse2)) (and (= ~z~0_In-2040396991 |ULTIMATE.start_main_#t~ite40_Out-2040396991|) (or .cse2 .cse1) .cse0))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2040396991, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2040396991, ~z$w_buff1~0=~z$w_buff1~0_In-2040396991, ~z~0=~z~0_In-2040396991} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2040396991|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2040396991|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2040396991, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2040396991, ~z$w_buff1~0=~z$w_buff1~0_In-2040396991, ~z~0=~z~0_In-2040396991} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:31:13,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In904817837 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In904817837 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In904817837 |ULTIMATE.start_main_#t~ite42_Out904817837|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out904817837| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In904817837, ~z$w_buff0_used~0=~z$w_buff0_used~0_In904817837} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In904817837, ~z$w_buff0_used~0=~z$w_buff0_used~0_In904817837, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out904817837|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:31:13,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1419745845 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1419745845 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1419745845 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1419745845 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1419745845 |ULTIMATE.start_main_#t~ite43_Out1419745845|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1419745845|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1419745845, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1419745845, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1419745845, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1419745845} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1419745845, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1419745845, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1419745845, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1419745845, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1419745845|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 13:31:13,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-523104115 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-523104115 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-523104115| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-523104115| ~z$r_buff0_thd0~0_In-523104115)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-523104115, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-523104115} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-523104115, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-523104115, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-523104115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:31:13,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-774241951 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-774241951 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-774241951 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-774241951 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-774241951 |ULTIMATE.start_main_#t~ite45_Out-774241951|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-774241951|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-774241951, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-774241951, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-774241951, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-774241951} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-774241951, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-774241951, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-774241951, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-774241951, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-774241951|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:31:13,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p1_EBX~0_28 0) (= v_~z$r_buff1_thd0~0_107 |v_ULTIMATE.start_main_#t~ite45_60|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_28) (= v_~x~0_67 2) (= v_~main$tmp_guard1~0_22 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_107, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_59|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:31:13,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:31:13 BasicIcfg [2019-12-18 13:31:13,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:31:13,216 INFO L168 Benchmark]: Toolchain (without parser) took 14159.17 ms. Allocated memory was 138.9 MB in the beginning and 454.0 MB in the end (delta: 315.1 MB). Free memory was 102.7 MB in the beginning and 167.1 MB in the end (delta: -64.4 MB). Peak memory consumption was 250.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:13,217 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:31:13,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.04 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 157.7 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:13,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.49 ms. Allocated memory is still 202.9 MB. Free memory was 157.7 MB in the beginning and 155.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:31:13,219 INFO L168 Benchmark]: Boogie Preprocessor took 58.00 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.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:31:13,220 INFO L168 Benchmark]: RCFGBuilder took 806.47 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 107.7 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:13,220 INFO L168 Benchmark]: TraceAbstraction took 12447.77 ms. Allocated memory was 202.9 MB in the beginning and 454.0 MB in the end (delta: 251.1 MB). Free memory was 107.7 MB in the beginning and 167.1 MB in the end (delta: -59.4 MB). Peak memory consumption was 191.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:13,224 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.47 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.04 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 157.7 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.49 ms. Allocated memory is still 202.9 MB. Free memory was 157.7 MB in the beginning and 155.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 58.00 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.47 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 107.7 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12447.77 ms. Allocated memory was 202.9 MB in the beginning and 454.0 MB in the end (delta: 251.1 MB). Free memory was 107.7 MB in the beginning and 167.1 MB in the end (delta: -59.4 MB). Peak memory consumption was 191.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 13 FixpointIterations, 30 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 25 ChoiceCompositions, 4608 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 234 SemBasedMoverChecksPositive, 187 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 82827 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1097, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$w_buff0_used = (_Bool)1 [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t1098, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L813] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1998 SDtfs, 1491 SDslu, 3264 SDs, 0 SdLazy, 1790 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred 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: 1.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 2784 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 549 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 88003 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...