/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:33:49,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:33:49,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:33:49,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:33:49,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:33:49,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:33:49,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:33:49,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:33:49,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:33:49,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:33:49,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:33:49,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:33:49,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:33:49,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:33:49,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:33:49,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:33:49,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:33:49,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:33:49,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:33:49,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:33:49,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:33:49,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:33:49,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:33:49,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:33:49,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:33:49,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:33:49,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:33:49,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:33:49,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:33:49,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:33:49,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:33:49,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:33:49,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:33:49,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:33:49,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:33:49,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:33:49,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:33:49,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:33:49,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:33:49,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:33:49,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:33:49,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:33:49,839 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:33:49,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:33:49,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:33:49,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:33:49,841 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:33:49,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:33:49,841 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:33:49,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:33:49,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:33:49,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:33:49,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:33:49,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:33:49,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:33:49,843 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:33:49,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:33:49,843 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:33:49,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:33:49,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:33:49,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:33:49,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:33:49,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:33:49,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:33:49,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:33:49,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:33:49,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:33:49,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:33:49,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:33:49,845 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:33:49,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:33:49,846 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:33:50,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:33:50,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:33:50,131 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:33:50,132 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:33:50,133 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:33:50,134 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2019-12-18 21:33:50,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae0f8a53/65c84ea9d91d48a8bb19337e749e6bd2/FLAG8f6ce1321 [2019-12-18 21:33:50,775 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:33:50,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2019-12-18 21:33:50,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae0f8a53/65c84ea9d91d48a8bb19337e749e6bd2/FLAG8f6ce1321 [2019-12-18 21:33:51,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae0f8a53/65c84ea9d91d48a8bb19337e749e6bd2 [2019-12-18 21:33:51,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:33:51,051 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:33:51,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:33:51,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:33:51,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:33:51,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:33:51" (1/1) ... [2019-12-18 21:33:51,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3034bd42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:51, skipping insertion in model container [2019-12-18 21:33:51,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:33:51" (1/1) ... [2019-12-18 21:33:51,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:33:51,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:33:51,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:33:51,682 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:33:51,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:33:51,849 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:33:51,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:51 WrapperNode [2019-12-18 21:33:51,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:33:51,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:33:51,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:33:51,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:33:51,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:51" (1/1) ... [2019-12-18 21:33:51,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:51" (1/1) ... [2019-12-18 21:33:51,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:33:51,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:33:51,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:33:51,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:33:51,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:51" (1/1) ... [2019-12-18 21:33:51,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:51" (1/1) ... [2019-12-18 21:33:51,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:51" (1/1) ... [2019-12-18 21:33:51,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:51" (1/1) ... [2019-12-18 21:33:51,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:51" (1/1) ... [2019-12-18 21:33:51,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:51" (1/1) ... [2019-12-18 21:33:51,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:51" (1/1) ... [2019-12-18 21:33:51,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:33:51,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:33:51,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:33:51,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:33:51,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:51" (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 21:33:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:33:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:33:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:33:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:33:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:33:52,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:33:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:33:52,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:33:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:33:52,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:33:52,039 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:33:52,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:33:52,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:33:52,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:33:52,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:33:52,042 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 21:33:52,817 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:33:52,818 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:33:52,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:33:52 BoogieIcfgContainer [2019-12-18 21:33:52,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:33:52,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:33:52,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:33:52,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:33:52,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:33:51" (1/3) ... [2019-12-18 21:33:52,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4983d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:33:52, skipping insertion in model container [2019-12-18 21:33:52,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:51" (2/3) ... [2019-12-18 21:33:52,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4983d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:33:52, skipping insertion in model container [2019-12-18 21:33:52,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:33:52" (3/3) ... [2019-12-18 21:33:52,831 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_power.opt.i [2019-12-18 21:33:52,842 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:33:52,842 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:33:52,855 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:33:52,857 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:33:52,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,902 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,902 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,904 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,904 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,905 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,905 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,913 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,913 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,913 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,913 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,913 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,914 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,914 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,919 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,919 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,919 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,919 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,945 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,948 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,948 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,951 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,952 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,953 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:52,969 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:33:52,987 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:33:52,987 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:33:52,987 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:33:52,987 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:33:52,987 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:33:52,988 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:33:52,988 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:33:52,988 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:33:53,006 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-18 21:33:53,008 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 21:33:53,095 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 21:33:53,096 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:33:53,111 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:33:53,133 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 21:33:53,178 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 21:33:53,178 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:33:53,185 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:33:53,199 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:33:53,201 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:33:56,748 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 21:33:56,894 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 21:33:56,944 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52826 [2019-12-18 21:33:56,944 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 21:33:56,948 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-18 21:34:00,178 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 38654 states. [2019-12-18 21:34:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 38654 states. [2019-12-18 21:34:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:34:00,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:00,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:00,189 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:00,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:00,194 INFO L82 PathProgramCache]: Analyzing trace with hash -313660218, now seen corresponding path program 1 times [2019-12-18 21:34:00,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:00,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444265103] [2019-12-18 21:34:00,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:00,531 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 21:34:00,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444265103] [2019-12-18 21:34:00,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:00,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:34:00,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714176276] [2019-12-18 21:34:00,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:34:00,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:00,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:34:00,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:34:00,560 INFO L87 Difference]: Start difference. First operand 38654 states. Second operand 3 states. [2019-12-18 21:34:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:01,525 INFO L93 Difference]: Finished difference Result 36046 states and 153176 transitions. [2019-12-18 21:34:01,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:34:01,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:34:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:01,848 INFO L225 Difference]: With dead ends: 36046 [2019-12-18 21:34:01,848 INFO L226 Difference]: Without dead ends: 35318 [2019-12-18 21:34:01,850 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 21:34:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35318 states. [2019-12-18 21:34:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35318 to 35318. [2019-12-18 21:34:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35318 states. [2019-12-18 21:34:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35318 states to 35318 states and 150208 transitions. [2019-12-18 21:34:05,360 INFO L78 Accepts]: Start accepts. Automaton has 35318 states and 150208 transitions. Word has length 9 [2019-12-18 21:34:05,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:05,363 INFO L462 AbstractCegarLoop]: Abstraction has 35318 states and 150208 transitions. [2019-12-18 21:34:05,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:34:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 35318 states and 150208 transitions. [2019-12-18 21:34:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:34:05,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:05,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:05,381 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:05,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:05,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1224255535, now seen corresponding path program 1 times [2019-12-18 21:34:05,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:05,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844797497] [2019-12-18 21:34:05,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:05,521 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 21:34:05,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844797497] [2019-12-18 21:34:05,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:05,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:34:05,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805793171] [2019-12-18 21:34:05,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:34:05,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:05,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:34:05,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:34:05,526 INFO L87 Difference]: Start difference. First operand 35318 states and 150208 transitions. Second operand 4 states. [2019-12-18 21:34:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:06,551 INFO L93 Difference]: Finished difference Result 54990 states and 226052 transitions. [2019-12-18 21:34:06,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:34:06,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:34:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:07,369 INFO L225 Difference]: With dead ends: 54990 [2019-12-18 21:34:07,369 INFO L226 Difference]: Without dead ends: 54962 [2019-12-18 21:34:07,370 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 21:34:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54962 states. [2019-12-18 21:34:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54962 to 50002. [2019-12-18 21:34:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50002 states. [2019-12-18 21:34:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50002 states to 50002 states and 207548 transitions. [2019-12-18 21:34:09,504 INFO L78 Accepts]: Start accepts. Automaton has 50002 states and 207548 transitions. Word has length 15 [2019-12-18 21:34:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:09,504 INFO L462 AbstractCegarLoop]: Abstraction has 50002 states and 207548 transitions. [2019-12-18 21:34:09,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:34:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 50002 states and 207548 transitions. [2019-12-18 21:34:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:34:09,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:09,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:09,508 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:09,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:09,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1764776836, now seen corresponding path program 1 times [2019-12-18 21:34:09,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:09,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181588345] [2019-12-18 21:34:09,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:09,599 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 21:34:09,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181588345] [2019-12-18 21:34:09,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:09,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:34:09,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616817585] [2019-12-18 21:34:09,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:34:09,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:09,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:34:09,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:34:09,604 INFO L87 Difference]: Start difference. First operand 50002 states and 207548 transitions. Second operand 3 states. [2019-12-18 21:34:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:11,397 INFO L93 Difference]: Finished difference Result 39218 states and 150397 transitions. [2019-12-18 21:34:11,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:34:11,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:34:11,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:11,528 INFO L225 Difference]: With dead ends: 39218 [2019-12-18 21:34:11,528 INFO L226 Difference]: Without dead ends: 39218 [2019-12-18 21:34:11,529 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 21:34:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39218 states. [2019-12-18 21:34:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39218 to 39218. [2019-12-18 21:34:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39218 states. [2019-12-18 21:34:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39218 states to 39218 states and 150397 transitions. [2019-12-18 21:34:12,719 INFO L78 Accepts]: Start accepts. Automaton has 39218 states and 150397 transitions. Word has length 15 [2019-12-18 21:34:12,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:12,720 INFO L462 AbstractCegarLoop]: Abstraction has 39218 states and 150397 transitions. [2019-12-18 21:34:12,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:34:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 39218 states and 150397 transitions. [2019-12-18 21:34:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:34:12,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:12,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:12,723 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:12,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:12,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1883411785, now seen corresponding path program 1 times [2019-12-18 21:34:12,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:12,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659365295] [2019-12-18 21:34:12,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:12,799 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 21:34:12,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659365295] [2019-12-18 21:34:12,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:12,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:34:12,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446589732] [2019-12-18 21:34:12,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:34:12,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:12,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:34:12,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:34:12,801 INFO L87 Difference]: Start difference. First operand 39218 states and 150397 transitions. Second operand 4 states. [2019-12-18 21:34:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:12,881 INFO L93 Difference]: Finished difference Result 16304 states and 51852 transitions. [2019-12-18 21:34:12,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:34:12,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:34:12,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:12,918 INFO L225 Difference]: With dead ends: 16304 [2019-12-18 21:34:12,918 INFO L226 Difference]: Without dead ends: 16304 [2019-12-18 21:34:12,919 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 21:34:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16304 states. [2019-12-18 21:34:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16304 to 16304. [2019-12-18 21:34:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16304 states. [2019-12-18 21:34:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16304 states to 16304 states and 51852 transitions. [2019-12-18 21:34:13,739 INFO L78 Accepts]: Start accepts. Automaton has 16304 states and 51852 transitions. Word has length 16 [2019-12-18 21:34:13,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:13,740 INFO L462 AbstractCegarLoop]: Abstraction has 16304 states and 51852 transitions. [2019-12-18 21:34:13,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:34:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 16304 states and 51852 transitions. [2019-12-18 21:34:13,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:34:13,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:13,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:13,744 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:13,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:13,744 INFO L82 PathProgramCache]: Analyzing trace with hash 471912602, now seen corresponding path program 1 times [2019-12-18 21:34:13,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:13,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147795672] [2019-12-18 21:34:13,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:13,827 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 21:34:13,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147795672] [2019-12-18 21:34:13,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:13,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:34:13,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761824033] [2019-12-18 21:34:13,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:34:13,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:13,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:34:13,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:34:13,830 INFO L87 Difference]: Start difference. First operand 16304 states and 51852 transitions. Second operand 5 states. [2019-12-18 21:34:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:13,879 INFO L93 Difference]: Finished difference Result 2786 states and 7200 transitions. [2019-12-18 21:34:13,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:34:13,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:34:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:13,885 INFO L225 Difference]: With dead ends: 2786 [2019-12-18 21:34:13,886 INFO L226 Difference]: Without dead ends: 2786 [2019-12-18 21:34:13,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:34:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2019-12-18 21:34:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2786. [2019-12-18 21:34:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2786 states. [2019-12-18 21:34:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 7200 transitions. [2019-12-18 21:34:13,932 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 7200 transitions. Word has length 17 [2019-12-18 21:34:13,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:13,933 INFO L462 AbstractCegarLoop]: Abstraction has 2786 states and 7200 transitions. [2019-12-18 21:34:13,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:34:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 7200 transitions. [2019-12-18 21:34:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:34:13,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:13,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:13,940 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:13,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:13,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1539396208, now seen corresponding path program 1 times [2019-12-18 21:34:13,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:13,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998738647] [2019-12-18 21:34:13,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:14,055 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 21:34:14,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998738647] [2019-12-18 21:34:14,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:14,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:34:14,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682442666] [2019-12-18 21:34:14,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:34:14,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:14,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:34:14,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:34:14,057 INFO L87 Difference]: Start difference. First operand 2786 states and 7200 transitions. Second operand 6 states. [2019-12-18 21:34:14,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:14,104 INFO L93 Difference]: Finished difference Result 1356 states and 3887 transitions. [2019-12-18 21:34:14,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:34:14,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 21:34:14,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:14,107 INFO L225 Difference]: With dead ends: 1356 [2019-12-18 21:34:14,108 INFO L226 Difference]: Without dead ends: 1356 [2019-12-18 21:34:14,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:34:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2019-12-18 21:34:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1216. [2019-12-18 21:34:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2019-12-18 21:34:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 3487 transitions. [2019-12-18 21:34:14,126 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 3487 transitions. Word has length 29 [2019-12-18 21:34:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:14,126 INFO L462 AbstractCegarLoop]: Abstraction has 1216 states and 3487 transitions. [2019-12-18 21:34:14,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:34:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 3487 transitions. [2019-12-18 21:34:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:34:14,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:14,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:14,131 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:14,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1329665717, now seen corresponding path program 1 times [2019-12-18 21:34:14,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:14,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281189576] [2019-12-18 21:34:14,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:14,214 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 21:34:14,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281189576] [2019-12-18 21:34:14,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:14,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:34:14,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169499244] [2019-12-18 21:34:14,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:34:14,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:14,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:34:14,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:34:14,216 INFO L87 Difference]: Start difference. First operand 1216 states and 3487 transitions. Second operand 3 states. [2019-12-18 21:34:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:14,260 INFO L93 Difference]: Finished difference Result 1224 states and 3495 transitions. [2019-12-18 21:34:14,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:34:14,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:34:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:14,263 INFO L225 Difference]: With dead ends: 1224 [2019-12-18 21:34:14,263 INFO L226 Difference]: Without dead ends: 1224 [2019-12-18 21:34:14,264 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 21:34:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-12-18 21:34:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1219. [2019-12-18 21:34:14,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2019-12-18 21:34:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 3490 transitions. [2019-12-18 21:34:14,284 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 3490 transitions. Word has length 58 [2019-12-18 21:34:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:14,284 INFO L462 AbstractCegarLoop]: Abstraction has 1219 states and 3490 transitions. [2019-12-18 21:34:14,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:34:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 3490 transitions. [2019-12-18 21:34:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:34:14,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:14,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:14,289 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:14,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1606563127, now seen corresponding path program 1 times [2019-12-18 21:34:14,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:14,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254446438] [2019-12-18 21:34:14,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:14,390 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 21:34:14,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254446438] [2019-12-18 21:34:14,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:14,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:34:14,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701609387] [2019-12-18 21:34:14,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:34:14,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:14,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:34:14,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:34:14,392 INFO L87 Difference]: Start difference. First operand 1219 states and 3490 transitions. Second operand 5 states. [2019-12-18 21:34:14,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:14,642 INFO L93 Difference]: Finished difference Result 1760 states and 5012 transitions. [2019-12-18 21:34:14,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:34:14,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 21:34:14,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:14,645 INFO L225 Difference]: With dead ends: 1760 [2019-12-18 21:34:14,646 INFO L226 Difference]: Without dead ends: 1760 [2019-12-18 21:34:14,646 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 21:34:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2019-12-18 21:34:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1415. [2019-12-18 21:34:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-12-18 21:34:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 4066 transitions. [2019-12-18 21:34:14,663 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 4066 transitions. Word has length 58 [2019-12-18 21:34:14,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:14,664 INFO L462 AbstractCegarLoop]: Abstraction has 1415 states and 4066 transitions. [2019-12-18 21:34:14,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:34:14,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 4066 transitions. [2019-12-18 21:34:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:34:14,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:14,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:14,668 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:14,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:14,669 INFO L82 PathProgramCache]: Analyzing trace with hash 595510245, now seen corresponding path program 2 times [2019-12-18 21:34:14,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:14,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881465672] [2019-12-18 21:34:14,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:34:14,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881465672] [2019-12-18 21:34:14,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:14,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:34:14,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526942348] [2019-12-18 21:34:14,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:34:14,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:14,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:34:14,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:34:14,777 INFO L87 Difference]: Start difference. First operand 1415 states and 4066 transitions. Second operand 6 states. [2019-12-18 21:34:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:15,157 INFO L93 Difference]: Finished difference Result 2366 states and 6730 transitions. [2019-12-18 21:34:15,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:34:15,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:34:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:15,161 INFO L225 Difference]: With dead ends: 2366 [2019-12-18 21:34:15,162 INFO L226 Difference]: Without dead ends: 2366 [2019-12-18 21:34:15,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:34:15,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2019-12-18 21:34:15,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 1499. [2019-12-18 21:34:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2019-12-18 21:34:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 4314 transitions. [2019-12-18 21:34:15,194 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 4314 transitions. Word has length 58 [2019-12-18 21:34:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:15,194 INFO L462 AbstractCegarLoop]: Abstraction has 1499 states and 4314 transitions. [2019-12-18 21:34:15,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:34:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 4314 transitions. [2019-12-18 21:34:15,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:34:15,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:15,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:15,199 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:15,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1233712533, now seen corresponding path program 3 times [2019-12-18 21:34:15,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:15,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047326368] [2019-12-18 21:34:15,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:15,278 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 21:34:15,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047326368] [2019-12-18 21:34:15,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:15,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:34:15,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939615807] [2019-12-18 21:34:15,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:34:15,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:15,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:34:15,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:34:15,280 INFO L87 Difference]: Start difference. First operand 1499 states and 4314 transitions. Second operand 3 states. [2019-12-18 21:34:15,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:15,330 INFO L93 Difference]: Finished difference Result 1499 states and 4313 transitions. [2019-12-18 21:34:15,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:34:15,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:34:15,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:15,333 INFO L225 Difference]: With dead ends: 1499 [2019-12-18 21:34:15,334 INFO L226 Difference]: Without dead ends: 1499 [2019-12-18 21:34:15,334 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 21:34:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-12-18 21:34:15,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1078. [2019-12-18 21:34:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2019-12-18 21:34:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 3127 transitions. [2019-12-18 21:34:15,360 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 3127 transitions. Word has length 58 [2019-12-18 21:34:15,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:15,360 INFO L462 AbstractCegarLoop]: Abstraction has 1078 states and 3127 transitions. [2019-12-18 21:34:15,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:34:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 3127 transitions. [2019-12-18 21:34:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:34:15,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:15,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:15,365 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:15,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:15,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2055576731, now seen corresponding path program 1 times [2019-12-18 21:34:15,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:15,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400714975] [2019-12-18 21:34:15,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:15,561 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 21:34:15,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400714975] [2019-12-18 21:34:15,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:15,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:34:15,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845842903] [2019-12-18 21:34:15,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:34:15,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:15,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:34:15,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:34:15,564 INFO L87 Difference]: Start difference. First operand 1078 states and 3127 transitions. Second operand 7 states. [2019-12-18 21:34:15,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:15,697 INFO L93 Difference]: Finished difference Result 2240 states and 6163 transitions. [2019-12-18 21:34:15,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:34:15,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-18 21:34:15,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:15,701 INFO L225 Difference]: With dead ends: 2240 [2019-12-18 21:34:15,701 INFO L226 Difference]: Without dead ends: 1591 [2019-12-18 21:34:15,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:34:15,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-12-18 21:34:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 948. [2019-12-18 21:34:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-12-18 21:34:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2687 transitions. [2019-12-18 21:34:15,717 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2687 transitions. Word has length 59 [2019-12-18 21:34:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:15,718 INFO L462 AbstractCegarLoop]: Abstraction has 948 states and 2687 transitions. [2019-12-18 21:34:15,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:34:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2687 transitions. [2019-12-18 21:34:15,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:34:15,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:15,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:15,721 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:15,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:15,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1719937123, now seen corresponding path program 2 times [2019-12-18 21:34:15,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:15,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119938033] [2019-12-18 21:34:15,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:15,871 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 21:34:15,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119938033] [2019-12-18 21:34:15,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:15,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:34:15,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364580356] [2019-12-18 21:34:15,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:34:15,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:15,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:34:15,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:34:15,874 INFO L87 Difference]: Start difference. First operand 948 states and 2687 transitions. Second operand 6 states. [2019-12-18 21:34:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:15,970 INFO L93 Difference]: Finished difference Result 1654 states and 4372 transitions. [2019-12-18 21:34:15,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:34:15,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 21:34:15,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:15,973 INFO L225 Difference]: With dead ends: 1654 [2019-12-18 21:34:15,973 INFO L226 Difference]: Without dead ends: 923 [2019-12-18 21:34:15,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:34:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-18 21:34:15,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 691. [2019-12-18 21:34:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-12-18 21:34:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1728 transitions. [2019-12-18 21:34:15,987 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1728 transitions. Word has length 59 [2019-12-18 21:34:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:15,987 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1728 transitions. [2019-12-18 21:34:15,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:34:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1728 transitions. [2019-12-18 21:34:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:34:15,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:15,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:15,990 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:15,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:15,991 INFO L82 PathProgramCache]: Analyzing trace with hash -5405835, now seen corresponding path program 3 times [2019-12-18 21:34:15,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:15,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216956697] [2019-12-18 21:34:15,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:16,173 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 21:34:16,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216956697] [2019-12-18 21:34:16,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:16,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:34:16,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280489945] [2019-12-18 21:34:16,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:34:16,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:16,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:34:16,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:34:16,175 INFO L87 Difference]: Start difference. First operand 691 states and 1728 transitions. Second operand 6 states. [2019-12-18 21:34:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:16,264 INFO L93 Difference]: Finished difference Result 1176 states and 2907 transitions. [2019-12-18 21:34:16,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:34:16,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 21:34:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:16,265 INFO L225 Difference]: With dead ends: 1176 [2019-12-18 21:34:16,265 INFO L226 Difference]: Without dead ends: 343 [2019-12-18 21:34:16,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:34:16,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-18 21:34:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 287. [2019-12-18 21:34:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-12-18 21:34:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 530 transitions. [2019-12-18 21:34:16,270 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 530 transitions. Word has length 59 [2019-12-18 21:34:16,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:16,271 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 530 transitions. [2019-12-18 21:34:16,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:34:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 530 transitions. [2019-12-18 21:34:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:34:16,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:16,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:16,272 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:16,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:16,272 INFO L82 PathProgramCache]: Analyzing trace with hash -2094447461, now seen corresponding path program 4 times [2019-12-18 21:34:16,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:16,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791238540] [2019-12-18 21:34:16,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:16,333 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 21:34:16,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791238540] [2019-12-18 21:34:16,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:16,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:34:16,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201218522] [2019-12-18 21:34:16,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:34:16,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:16,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:34:16,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:34:16,354 INFO L87 Difference]: Start difference. First operand 287 states and 530 transitions. Second operand 3 states. [2019-12-18 21:34:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:16,367 INFO L93 Difference]: Finished difference Result 266 states and 473 transitions. [2019-12-18 21:34:16,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:34:16,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:34:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:16,368 INFO L225 Difference]: With dead ends: 266 [2019-12-18 21:34:16,368 INFO L226 Difference]: Without dead ends: 266 [2019-12-18 21:34:16,369 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 21:34:16,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-18 21:34:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 234. [2019-12-18 21:34:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-18 21:34:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 413 transitions. [2019-12-18 21:34:16,373 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 413 transitions. Word has length 59 [2019-12-18 21:34:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:16,374 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 413 transitions. [2019-12-18 21:34:16,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:34:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 413 transitions. [2019-12-18 21:34:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:34:16,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:16,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:16,375 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:16,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:16,376 INFO L82 PathProgramCache]: Analyzing trace with hash 91372008, now seen corresponding path program 1 times [2019-12-18 21:34:16,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:16,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488921882] [2019-12-18 21:34:16,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:16,702 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 21:34:16,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488921882] [2019-12-18 21:34:16,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:16,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:34:16,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683598137] [2019-12-18 21:34:16,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:34:16,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:16,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:34:16,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:34:16,705 INFO L87 Difference]: Start difference. First operand 234 states and 413 transitions. Second operand 13 states. [2019-12-18 21:34:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:17,188 INFO L93 Difference]: Finished difference Result 398 states and 685 transitions. [2019-12-18 21:34:17,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:34:17,189 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 21:34:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:17,190 INFO L225 Difference]: With dead ends: 398 [2019-12-18 21:34:17,190 INFO L226 Difference]: Without dead ends: 368 [2019-12-18 21:34:17,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:34:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-12-18 21:34:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 342. [2019-12-18 21:34:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-18 21:34:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 598 transitions. [2019-12-18 21:34:17,197 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 598 transitions. Word has length 60 [2019-12-18 21:34:17,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:17,197 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 598 transitions. [2019-12-18 21:34:17,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:34:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 598 transitions. [2019-12-18 21:34:17,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:34:17,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:17,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:17,199 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:17,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:17,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1093452108, now seen corresponding path program 2 times [2019-12-18 21:34:17,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:17,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253785085] [2019-12-18 21:34:17,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:34:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:34:17,321 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:34:17,321 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:34:17,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= v_~z$r_buff0_thd0~0_78 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= v_~z$r_buff1_thd2~0_8 0) (= v_~x~0_14 0) (= 0 v_~a~0_8) (= 0 v_~__unbuffered_p3_EBX~0_11) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$w_buff0_used~0_104 0) (= v_~z$mem_tmp~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (= 0 v_~__unbuffered_p3_EAX~0_11) (= 0 v_~z$r_buff1_thd4~0_15) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t1253~0.base_21| 1)) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1253~0.base_21| 4)) (= 0 v_~weak$$choice2~0_34) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$r_buff1_thd0~0_51) (= 0 v_~__unbuffered_cnt~0_26) (= 0 v_~z$flush_delayed~0_16) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1253~0.base_21|) (= v_~z$r_buff0_thd4~0_26 0) (= v_~z$read_delayed_var~0.offset_5 0) (= 0 |v_#NULL.base_6|) (= 0 |v_ULTIMATE.start_main_~#t1253~0.offset_17|) (= 0 v_~z$r_buff1_thd3~0_15) (< 0 |v_#StackHeapBarrier_20|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1253~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1253~0.base_21|) |v_ULTIMATE.start_main_~#t1253~0.offset_17| 0)) |v_#memory_int_23|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~z$w_buff0~0_26) (= v_~y~0_11 0) (= v_~main$tmp_guard1~0_13 0) (= v_~b~0_12 0) (= 0 v_~z$w_buff1_used~0_66) (= (select .cse0 |v_ULTIMATE.start_main_~#t1253~0.base_21|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ULTIMATE.start_main_~#t1256~0.base=|v_ULTIMATE.start_main_~#t1256~0.base_23|, ULTIMATE.start_main_~#t1256~0.offset=|v_ULTIMATE.start_main_~#t1256~0.offset_18|, ~a~0=v_~a~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_78, ULTIMATE.start_main_~#t1253~0.offset=|v_ULTIMATE.start_main_~#t1253~0.offset_17|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_~#t1255~0.offset=|v_ULTIMATE.start_main_~#t1255~0.offset_18|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_66, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ULTIMATE.start_main_~#t1254~0.offset=|v_ULTIMATE.start_main_~#t1254~0.offset_18|, ULTIMATE.start_main_~#t1253~0.base=|v_ULTIMATE.start_main_~#t1253~0.base_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_15, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_13|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_51, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1254~0.base=|v_ULTIMATE.start_main_~#t1254~0.base_23|, ULTIMATE.start_main_~#t1255~0.base=|v_ULTIMATE.start_main_~#t1255~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1256~0.base, ULTIMATE.start_main_~#t1256~0.offset, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1253~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1255~0.offset, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1254~0.offset, ULTIMATE.start_main_~#t1253~0.base, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1254~0.base, ULTIMATE.start_main_~#t1255~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:34:17,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L831-1-->L833: Formula: (and (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1254~0.base_13| 1)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1254~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1254~0.base_13|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1254~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1254~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1254~0.base_13|) |v_ULTIMATE.start_main_~#t1254~0.offset_11| 1)) |v_#memory_int_15|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1254~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1254~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1254~0.offset=|v_ULTIMATE.start_main_~#t1254~0.offset_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1254~0.base=|v_ULTIMATE.start_main_~#t1254~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1254~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1254~0.base] because there is no mapped edge [2019-12-18 21:34:17,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-1-->L835: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1255~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1255~0.offset_10| 0) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1255~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1255~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1255~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1255~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1255~0.base_11|) |v_ULTIMATE.start_main_~#t1255~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1255~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1255~0.base=|v_ULTIMATE.start_main_~#t1255~0.base_11|, ULTIMATE.start_main_~#t1255~0.offset=|v_ULTIMATE.start_main_~#t1255~0.offset_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1255~0.base, ULTIMATE.start_main_~#t1255~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 21:34:17,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1256~0.base_13| 1) |v_#valid_46|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1256~0.base_13|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1256~0.base_13|) (= |v_ULTIMATE.start_main_~#t1256~0.offset_11| 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1256~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1256~0.base_13|) |v_ULTIMATE.start_main_~#t1256~0.offset_11| 3))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1256~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1256~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1256~0.offset=|v_ULTIMATE.start_main_~#t1256~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1256~0.base=|v_ULTIMATE.start_main_~#t1256~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1256~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1256~0.base] because there is no mapped edge [2019-12-18 21:34:17,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_14 v_~z$r_buff1_thd3~0_10) (= v_~z$r_buff0_thd0~0_61 v_~z$r_buff1_thd0~0_39) (= v_~z$r_buff1_thd1~0_4 v_~z$r_buff0_thd1~0_3) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_5) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff0_thd4~0_17 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_3) (= v_~z$r_buff0_thd4~0_16 1) (= 1 v_~a~0_3)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_4, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 21:34:17,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x~0_10 1) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~b~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_10, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:34:17,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_8) (= 1 v_~y~0_5) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~y~0=v_~y~0_5, ~x~0=v_~x~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:34:17,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-990273917 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-990273917 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-990273917|) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out-990273917| ~z$w_buff0_used~0_In-990273917)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-990273917, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-990273917} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-990273917, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-990273917, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-990273917|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:34:17,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In333364992 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In333364992 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In333364992 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In333364992 256)))) (or (and (= ~z$w_buff1_used~0_In333364992 |P3Thread1of1ForFork3_#t~ite12_Out333364992|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out333364992|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In333364992, ~z$w_buff0_used~0=~z$w_buff0_used~0_In333364992, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In333364992, ~z$w_buff1_used~0=~z$w_buff1_used~0_In333364992} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In333364992, ~z$w_buff0_used~0=~z$w_buff0_used~0_In333364992, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In333364992, ~z$w_buff1_used~0=~z$w_buff1_used~0_In333364992, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out333364992|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:34:17,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1662594891 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1662594891 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-1662594891 |P2Thread1of1ForFork2_#t~ite3_Out-1662594891|)) (and (not .cse0) (= ~z$w_buff1~0_In-1662594891 |P2Thread1of1ForFork2_#t~ite3_Out-1662594891|) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1662594891, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1662594891, ~z$w_buff1~0=~z$w_buff1~0_In-1662594891, ~z~0=~z~0_In-1662594891} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1662594891|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1662594891, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1662594891, ~z$w_buff1~0=~z$w_buff1~0_In-1662594891, ~z~0=~z~0_In-1662594891} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:34:17,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= v_~z~0_17 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:34:17,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1087717673 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1087717673 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out1087717673|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1087717673 |P2Thread1of1ForFork2_#t~ite5_Out1087717673|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1087717673, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1087717673} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1087717673|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1087717673, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1087717673} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:34:17,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2064495137 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-2064495137 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-2064495137 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2064495137 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite6_Out-2064495137| 0)) (and (= |P2Thread1of1ForFork2_#t~ite6_Out-2064495137| ~z$w_buff1_used~0_In-2064495137) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2064495137, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2064495137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2064495137, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2064495137} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-2064495137|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2064495137, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2064495137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2064495137, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2064495137} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:34:17,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In830068943 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In830068943 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out830068943| ~z$r_buff0_thd3~0_In830068943)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out830068943| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In830068943, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In830068943} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In830068943, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In830068943, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out830068943|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:34:17,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In589061077 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In589061077 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In589061077 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In589061077 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out589061077| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite8_Out589061077| ~z$r_buff1_thd3~0_In589061077) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In589061077, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In589061077, ~z$w_buff1_used~0=~z$w_buff1_used~0_In589061077, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In589061077} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In589061077, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In589061077, ~z$w_buff1_used~0=~z$w_buff1_used~0_In589061077, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In589061077, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out589061077|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:34:17,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:34:17,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1857309231 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1857309231 256) 0))) (or (and (= 0 ~z$r_buff0_thd4~0_Out1857309231) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_Out1857309231 ~z$r_buff0_thd4~0_In1857309231)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1857309231, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1857309231} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1857309231, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1857309231, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1857309231|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:34:17,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1833235499 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1833235499 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1833235499 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1833235499 256)))) (or (and (= ~z$r_buff1_thd4~0_In-1833235499 |P3Thread1of1ForFork3_#t~ite14_Out-1833235499|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-1833235499|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1833235499, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1833235499, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1833235499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1833235499} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1833235499, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1833235499, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1833235499|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1833235499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1833235499} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:34:17,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L812-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_13, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:34:17,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 21:34:17,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-659861828 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-659861828 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out-659861828| |ULTIMATE.start_main_#t~ite20_Out-659861828|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-659861828| ~z~0_In-659861828) .cse2) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-659861828| ~z$w_buff1~0_In-659861828) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-659861828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-659861828, ~z$w_buff1~0=~z$w_buff1~0_In-659861828, ~z~0=~z~0_In-659861828} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-659861828|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-659861828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-659861828, ~z$w_buff1~0=~z$w_buff1~0_In-659861828, ~z~0=~z~0_In-659861828, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-659861828|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:34:17,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1090964792 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1090964792 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1090964792| ~z$w_buff0_used~0_In1090964792)) (and (= |ULTIMATE.start_main_#t~ite21_Out1090964792| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1090964792, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1090964792} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1090964792, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1090964792, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1090964792|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:34:17,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-514303880 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-514303880 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-514303880 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-514303880 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-514303880| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-514303880 |ULTIMATE.start_main_#t~ite22_Out-514303880|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-514303880, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-514303880, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-514303880, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-514303880} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-514303880, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-514303880, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-514303880, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-514303880, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-514303880|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:34:17,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1676036566 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1676036566 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1676036566 |ULTIMATE.start_main_#t~ite23_Out1676036566|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out1676036566|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1676036566, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1676036566} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1676036566, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1676036566, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1676036566|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:34:17,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In87702469 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In87702469 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In87702469 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In87702469 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In87702469 |ULTIMATE.start_main_#t~ite24_Out87702469|)) (and (= |ULTIMATE.start_main_#t~ite24_Out87702469| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In87702469, ~z$w_buff0_used~0=~z$w_buff0_used~0_In87702469, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In87702469, ~z$w_buff1_used~0=~z$w_buff1_used~0_In87702469} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In87702469, ~z$w_buff0_used~0=~z$w_buff0_used~0_In87702469, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In87702469, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out87702469|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In87702469} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:34:17,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L855-->L855-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1721913059 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite31_Out-1721913059| ~z$w_buff0~0_In-1721913059) (not .cse0) (= |ULTIMATE.start_main_#t~ite30_In-1721913059| |ULTIMATE.start_main_#t~ite30_Out-1721913059|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1721913059 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-1721913059 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1721913059 256) 0)) (and (= 0 (mod ~z$r_buff1_thd0~0_In-1721913059 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite31_Out-1721913059| |ULTIMATE.start_main_#t~ite30_Out-1721913059|) .cse0 (= |ULTIMATE.start_main_#t~ite30_Out-1721913059| ~z$w_buff0~0_In-1721913059)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1721913059, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In-1721913059|, ~z$w_buff0~0=~z$w_buff0~0_In-1721913059, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1721913059, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1721913059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1721913059, ~weak$$choice2~0=~weak$$choice2~0_In-1721913059} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1721913059, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1721913059|, ~z$w_buff0~0=~z$w_buff0~0_In-1721913059, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1721913059, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1721913059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1721913059, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1721913059|, ~weak$$choice2~0=~weak$$choice2~0_In-1721913059} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-18 21:34:17,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L856-->L856-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1743048620 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite34_Out-1743048620| |ULTIMATE.start_main_#t~ite33_Out-1743048620|) (= ~z$w_buff1~0_In-1743048620 |ULTIMATE.start_main_#t~ite33_Out-1743048620|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1743048620 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-1743048620 256) 0)) (= (mod ~z$w_buff0_used~0_In-1743048620 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1743048620 256) 0))))) (and (= ~z$w_buff1~0_In-1743048620 |ULTIMATE.start_main_#t~ite34_Out-1743048620|) (not .cse0) (= |ULTIMATE.start_main_#t~ite33_In-1743048620| |ULTIMATE.start_main_#t~ite33_Out-1743048620|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1743048620, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1743048620, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1743048620, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1743048620, ~z$w_buff1~0=~z$w_buff1~0_In-1743048620, ~weak$$choice2~0=~weak$$choice2~0_In-1743048620, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In-1743048620|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1743048620, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1743048620, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1743048620, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1743048620, ~z$w_buff1~0=~z$w_buff1~0_In-1743048620, ~weak$$choice2~0=~weak$$choice2~0_In-1743048620, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1743048620|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1743048620|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 21:34:17,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_58)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_58, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:34:17,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1257279951 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In1257279951| |ULTIMATE.start_main_#t~ite45_Out1257279951|) (= |ULTIMATE.start_main_#t~ite46_Out1257279951| ~z$r_buff1_thd0~0_In1257279951)) (and (= |ULTIMATE.start_main_#t~ite45_Out1257279951| ~z$r_buff1_thd0~0_In1257279951) (= |ULTIMATE.start_main_#t~ite45_Out1257279951| |ULTIMATE.start_main_#t~ite46_Out1257279951|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1257279951 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1257279951 256))) (= (mod ~z$w_buff0_used~0_In1257279951 256) 0) (and (= (mod ~z$w_buff1_used~0_In1257279951 256) 0) .cse1))) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1257279951, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1257279951, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1257279951, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1257279951, ~weak$$choice2~0=~weak$$choice2~0_In1257279951, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In1257279951|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1257279951, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1257279951, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1257279951, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1257279951, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1257279951|, ~weak$$choice2~0=~weak$$choice2~0_In1257279951, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1257279951|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:34:17,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= v_~z~0_20 v_~z$mem_tmp~0_6) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:34:17,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:34:17,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:34:17 BasicIcfg [2019-12-18 21:34:17,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:34:17,461 INFO L168 Benchmark]: Toolchain (without parser) took 26409.07 ms. Allocated memory was 145.2 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 101.3 MB in the beginning and 782.2 MB in the end (delta: -680.9 MB). Peak memory consumption was 527.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:34:17,462 INFO L168 Benchmark]: CDTParser took 1.50 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 21:34:17,465 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.52 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.9 MB in the beginning and 156.5 MB in the end (delta: -55.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:34:17,466 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.86 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:34:17,467 INFO L168 Benchmark]: Boogie Preprocessor took 40.58 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 150.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:34:17,467 INFO L168 Benchmark]: RCFGBuilder took 847.87 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 101.9 MB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:34:17,473 INFO L168 Benchmark]: TraceAbstraction took 24636.90 ms. Allocated memory was 203.4 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 100.9 MB in the beginning and 782.2 MB in the end (delta: -681.3 MB). Peak memory consumption was 468.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:34:17,479 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.50 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 798.52 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.9 MB in the beginning and 156.5 MB in the end (delta: -55.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.86 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.58 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 150.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.87 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 101.9 MB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24636.90 ms. Allocated memory was 203.4 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 100.9 MB in the beginning and 782.2 MB in the end (delta: -681.3 MB). Peak memory consumption was 468.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 180 ProgramPointsBefore, 92 ProgramPointsAfterwards, 208 TransitionsBefore, 99 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 4932 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 52826 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L772] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 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) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 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 [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L855] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L856] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L857] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1620 SDtfs, 1552 SDslu, 3527 SDs, 0 SdLazy, 1242 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50002occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 7727 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 614 ConstructedInterpolants, 0 QuantifiedInterpolants, 132598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...