/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:11:52,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:11:52,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:11:52,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:11:52,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:11:52,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:11:52,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:11:52,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:11:52,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:11:52,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:11:52,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:11:52,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:11:52,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:11:52,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:11:52,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:11:52,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:11:52,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:11:52,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:11:52,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:11:52,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:11:52,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:11:52,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:11:52,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:11:52,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:11:52,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:11:52,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:11:52,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:11:52,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:11:52,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:11:52,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:11:52,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:11:52,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:11:52,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:11:52,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:11:52,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:11:52,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:11:52,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:11:52,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:11:52,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:11:52,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:11:52,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:11:52,821 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:11:52,852 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:11:52,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:11:52,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:11:52,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:11:52,854 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:11:52,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:11:52,855 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:11:52,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:11:52,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:11:52,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:11:52,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:11:52,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:11:52,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:11:52,856 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:11:52,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:11:52,857 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:11:52,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:11:52,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:11:52,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:11:52,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:11:52,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:11:52,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:11:52,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:11:52,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:11:52,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:11:52,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:11:52,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:11:52,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:11:52,859 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:11:52,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:11:53,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:11:53,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:11:53,150 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:11:53,151 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:11:53,151 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:11:53,152 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.opt.i [2019-12-18 15:11:53,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6eede08a/08d7b7c5e9d24b85a16d7b7dde34e9b9/FLAG8a12c272b [2019-12-18 15:11:53,803 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:11:53,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.opt.i [2019-12-18 15:11:53,818 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6eede08a/08d7b7c5e9d24b85a16d7b7dde34e9b9/FLAG8a12c272b [2019-12-18 15:11:54,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6eede08a/08d7b7c5e9d24b85a16d7b7dde34e9b9 [2019-12-18 15:11:54,039 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:11:54,041 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:11:54,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:11:54,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:11:54,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:11:54,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:11:54" (1/1) ... [2019-12-18 15:11:54,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@393b8aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:54, skipping insertion in model container [2019-12-18 15:11:54,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:11:54" (1/1) ... [2019-12-18 15:11:54,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:11:54,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:11:54,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:11:54,599 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:11:54,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:11:54,779 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:11:54,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:54 WrapperNode [2019-12-18 15:11:54,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:11:54,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:11:54,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:11:54,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:11:54,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:54" (1/1) ... [2019-12-18 15:11:54,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:54" (1/1) ... [2019-12-18 15:11:54,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:11:54,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:11:54,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:11:54,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:11:54,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:54" (1/1) ... [2019-12-18 15:11:54,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:54" (1/1) ... [2019-12-18 15:11:54,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:54" (1/1) ... [2019-12-18 15:11:54,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:54" (1/1) ... [2019-12-18 15:11:54,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:54" (1/1) ... [2019-12-18 15:11:54,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:54" (1/1) ... [2019-12-18 15:11:54,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:54" (1/1) ... [2019-12-18 15:11:54,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:11:54,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:11:54,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:11:54,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:11:54,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:54" (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 15:11:54,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:11:54,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:11:54,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:11:54,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:11:54,939 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:11:54,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:11:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:11:54,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:11:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 15:11:54,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 15:11:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:11:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:11:54,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:11:54,942 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 15:11:55,625 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:11:55,626 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:11:55,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:11:55 BoogieIcfgContainer [2019-12-18 15:11:55,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:11:55,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:11:55,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:11:55,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:11:55,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:11:54" (1/3) ... [2019-12-18 15:11:55,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afe2756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:11:55, skipping insertion in model container [2019-12-18 15:11:55,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:54" (2/3) ... [2019-12-18 15:11:55,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afe2756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:11:55, skipping insertion in model container [2019-12-18 15:11:55,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:11:55" (3/3) ... [2019-12-18 15:11:55,640 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_power.opt.i [2019-12-18 15:11:55,652 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:11:55,652 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:11:55,666 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:11:55,667 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:11:55,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,708 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,709 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,711 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,712 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,749 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,750 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,751 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,758 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,759 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,772 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,772 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,777 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,795 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,802 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,803 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,805 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:55,823 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 15:11:55,843 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:11:55,844 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:11:55,844 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:11:55,844 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:11:55,844 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:11:55,844 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:11:55,844 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:11:55,844 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:11:55,860 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-18 15:11:55,862 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-18 15:11:55,944 INFO L126 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-18 15:11:55,944 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:11:55,958 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 15:11:55,978 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-18 15:11:56,019 INFO L126 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-18 15:11:56,019 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:11:56,028 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 15:11:56,044 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-18 15:11:56,045 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:12:00,921 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 15:12:01,033 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 15:12:01,268 INFO L206 etLargeBlockEncoding]: Checked pairs total: 63936 [2019-12-18 15:12:01,269 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 15:12:01,271 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 82 transitions [2019-12-18 15:12:02,217 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14042 states. [2019-12-18 15:12:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states. [2019-12-18 15:12:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 15:12:02,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:02,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:02,226 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:02,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:02,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1097508166, now seen corresponding path program 1 times [2019-12-18 15:12:02,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:02,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583986621] [2019-12-18 15:12:02,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:02,489 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 15:12:02,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583986621] [2019-12-18 15:12:02,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:02,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:12:02,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830185215] [2019-12-18 15:12:02,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:12:02,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:02,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:12:02,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:12:02,517 INFO L87 Difference]: Start difference. First operand 14042 states. Second operand 3 states. [2019-12-18 15:12:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:02,898 INFO L93 Difference]: Finished difference Result 13722 states and 52554 transitions. [2019-12-18 15:12:02,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:12:02,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 15:12:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:03,133 INFO L225 Difference]: With dead ends: 13722 [2019-12-18 15:12:03,133 INFO L226 Difference]: Without dead ends: 12214 [2019-12-18 15:12:03,134 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 15:12:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-12-18 15:12:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12214. [2019-12-18 15:12:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2019-12-18 15:12:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 46640 transitions. [2019-12-18 15:12:03,899 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 46640 transitions. Word has length 7 [2019-12-18 15:12:03,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:03,900 INFO L462 AbstractCegarLoop]: Abstraction has 12214 states and 46640 transitions. [2019-12-18 15:12:03,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:12:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 46640 transitions. [2019-12-18 15:12:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:12:03,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:03,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:03,906 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:03,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1356084764, now seen corresponding path program 1 times [2019-12-18 15:12:03,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:03,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473906668] [2019-12-18 15:12:03,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:04,045 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 15:12:04,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473906668] [2019-12-18 15:12:04,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:04,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:12:04,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225004018] [2019-12-18 15:12:04,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:12:04,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:04,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:12:04,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:12:04,050 INFO L87 Difference]: Start difference. First operand 12214 states and 46640 transitions. Second operand 4 states. [2019-12-18 15:12:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:04,616 INFO L93 Difference]: Finished difference Result 18446 states and 67942 transitions. [2019-12-18 15:12:04,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:12:04,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 15:12:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:04,724 INFO L225 Difference]: With dead ends: 18446 [2019-12-18 15:12:04,725 INFO L226 Difference]: Without dead ends: 18390 [2019-12-18 15:12:04,726 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 15:12:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18390 states. [2019-12-18 15:12:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18390 to 16710. [2019-12-18 15:12:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-18 15:12:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 62402 transitions. [2019-12-18 15:12:06,354 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 62402 transitions. Word has length 13 [2019-12-18 15:12:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:06,355 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 62402 transitions. [2019-12-18 15:12:06,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:12:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 62402 transitions. [2019-12-18 15:12:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 15:12:06,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:06,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:06,361 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:06,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash -280168635, now seen corresponding path program 1 times [2019-12-18 15:12:06,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:06,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827654257] [2019-12-18 15:12:06,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:06,459 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 15:12:06,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827654257] [2019-12-18 15:12:06,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:06,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:12:06,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044074054] [2019-12-18 15:12:06,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:12:06,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:06,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:12:06,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:12:06,461 INFO L87 Difference]: Start difference. First operand 16710 states and 62402 transitions. Second operand 5 states. [2019-12-18 15:12:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:06,980 INFO L93 Difference]: Finished difference Result 24000 states and 87901 transitions. [2019-12-18 15:12:06,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:12:06,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 15:12:06,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:07,100 INFO L225 Difference]: With dead ends: 24000 [2019-12-18 15:12:07,100 INFO L226 Difference]: Without dead ends: 23924 [2019-12-18 15:12:07,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:12:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23924 states. [2019-12-18 15:12:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23924 to 20292. [2019-12-18 15:12:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20292 states. [2019-12-18 15:12:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20292 states to 20292 states and 75385 transitions. [2019-12-18 15:12:08,851 INFO L78 Accepts]: Start accepts. Automaton has 20292 states and 75385 transitions. Word has length 16 [2019-12-18 15:12:08,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:08,851 INFO L462 AbstractCegarLoop]: Abstraction has 20292 states and 75385 transitions. [2019-12-18 15:12:08,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:12:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 20292 states and 75385 transitions. [2019-12-18 15:12:08,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:12:08,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:08,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:08,864 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:08,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:08,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1749985236, now seen corresponding path program 1 times [2019-12-18 15:12:08,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:08,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833870628] [2019-12-18 15:12:08,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:08,945 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 15:12:08,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833870628] [2019-12-18 15:12:08,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:08,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:12:08,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637439372] [2019-12-18 15:12:08,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:12:08,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:08,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:12:08,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:12:08,948 INFO L87 Difference]: Start difference. First operand 20292 states and 75385 transitions. Second operand 3 states. [2019-12-18 15:12:09,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:09,052 INFO L93 Difference]: Finished difference Result 20167 states and 74853 transitions. [2019-12-18 15:12:09,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:12:09,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 15:12:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:09,130 INFO L225 Difference]: With dead ends: 20167 [2019-12-18 15:12:09,131 INFO L226 Difference]: Without dead ends: 20167 [2019-12-18 15:12:09,131 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 15:12:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20167 states. [2019-12-18 15:12:09,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20167 to 20167. [2019-12-18 15:12:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20167 states. [2019-12-18 15:12:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20167 states to 20167 states and 74853 transitions. [2019-12-18 15:12:09,872 INFO L78 Accepts]: Start accepts. Automaton has 20167 states and 74853 transitions. Word has length 18 [2019-12-18 15:12:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:09,872 INFO L462 AbstractCegarLoop]: Abstraction has 20167 states and 74853 transitions. [2019-12-18 15:12:09,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:12:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 20167 states and 74853 transitions. [2019-12-18 15:12:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:12:09,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:09,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:09,883 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:09,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:09,883 INFO L82 PathProgramCache]: Analyzing trace with hash -292292173, now seen corresponding path program 1 times [2019-12-18 15:12:09,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:09,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64282524] [2019-12-18 15:12:09,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:09,966 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 15:12:09,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64282524] [2019-12-18 15:12:09,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:09,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:12:09,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434997713] [2019-12-18 15:12:09,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:12:09,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:09,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:12:09,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:12:09,969 INFO L87 Difference]: Start difference. First operand 20167 states and 74853 transitions. Second operand 3 states. [2019-12-18 15:12:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:10,072 INFO L93 Difference]: Finished difference Result 19155 states and 70209 transitions. [2019-12-18 15:12:10,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:12:10,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 15:12:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:10,119 INFO L225 Difference]: With dead ends: 19155 [2019-12-18 15:12:10,119 INFO L226 Difference]: Without dead ends: 19155 [2019-12-18 15:12:10,120 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 15:12:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19155 states. [2019-12-18 15:12:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19155 to 18891. [2019-12-18 15:12:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18891 states. [2019-12-18 15:12:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18891 states to 18891 states and 69309 transitions. [2019-12-18 15:12:10,626 INFO L78 Accepts]: Start accepts. Automaton has 18891 states and 69309 transitions. Word has length 19 [2019-12-18 15:12:10,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:10,627 INFO L462 AbstractCegarLoop]: Abstraction has 18891 states and 69309 transitions. [2019-12-18 15:12:10,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:12:10,627 INFO L276 IsEmpty]: Start isEmpty. Operand 18891 states and 69309 transitions. [2019-12-18 15:12:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:12:10,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:10,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:10,633 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:10,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:10,633 INFO L82 PathProgramCache]: Analyzing trace with hash 44045431, now seen corresponding path program 1 times [2019-12-18 15:12:10,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:10,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851425841] [2019-12-18 15:12:10,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:10,969 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2019-12-18 15:12:10,970 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 15:12:10,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851425841] [2019-12-18 15:12:10,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:10,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:12:10,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684294574] [2019-12-18 15:12:10,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:12:10,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:10,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:12:10,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:12:10,973 INFO L87 Difference]: Start difference. First operand 18891 states and 69309 transitions. Second operand 5 states. [2019-12-18 15:12:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:11,078 INFO L93 Difference]: Finished difference Result 3080 states and 9315 transitions. [2019-12-18 15:12:11,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:12:11,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 15:12:11,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:11,084 INFO L225 Difference]: With dead ends: 3080 [2019-12-18 15:12:11,084 INFO L226 Difference]: Without dead ends: 2014 [2019-12-18 15:12:11,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:12:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2019-12-18 15:12:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2014. [2019-12-18 15:12:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-18 15:12:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 5324 transitions. [2019-12-18 15:12:11,122 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 5324 transitions. Word has length 19 [2019-12-18 15:12:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:11,122 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 5324 transitions. [2019-12-18 15:12:11,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:12:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 5324 transitions. [2019-12-18 15:12:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 15:12:11,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:11,126 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 15:12:11,126 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:11,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:11,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1434647427, now seen corresponding path program 1 times [2019-12-18 15:12:11,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:11,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372796095] [2019-12-18 15:12:11,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:11,205 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 15:12:11,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372796095] [2019-12-18 15:12:11,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:11,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:12:11,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255712694] [2019-12-18 15:12:11,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:12:11,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:11,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:12:11,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:12:11,208 INFO L87 Difference]: Start difference. First operand 2014 states and 5324 transitions. Second operand 3 states. [2019-12-18 15:12:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:11,266 INFO L93 Difference]: Finished difference Result 2850 states and 7274 transitions. [2019-12-18 15:12:11,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:12:11,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 15:12:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:11,272 INFO L225 Difference]: With dead ends: 2850 [2019-12-18 15:12:11,272 INFO L226 Difference]: Without dead ends: 2850 [2019-12-18 15:12:11,273 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 15:12:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2019-12-18 15:12:11,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2110. [2019-12-18 15:12:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2110 states. [2019-12-18 15:12:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 5466 transitions. [2019-12-18 15:12:11,321 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 5466 transitions. Word has length 29 [2019-12-18 15:12:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:11,323 INFO L462 AbstractCegarLoop]: Abstraction has 2110 states and 5466 transitions. [2019-12-18 15:12:11,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:12:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 5466 transitions. [2019-12-18 15:12:11,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 15:12:11,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:11,326 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 15:12:11,326 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:11,327 INFO L82 PathProgramCache]: Analyzing trace with hash 364652847, now seen corresponding path program 1 times [2019-12-18 15:12:11,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:11,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131625699] [2019-12-18 15:12:11,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:11,423 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 15:12:11,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131625699] [2019-12-18 15:12:11,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:11,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:12:11,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038413285] [2019-12-18 15:12:11,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:12:11,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:11,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:12:11,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:12:11,427 INFO L87 Difference]: Start difference. First operand 2110 states and 5466 transitions. Second operand 6 states. [2019-12-18 15:12:11,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:11,722 INFO L93 Difference]: Finished difference Result 3354 states and 8440 transitions. [2019-12-18 15:12:11,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:12:11,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 15:12:11,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:11,727 INFO L225 Difference]: With dead ends: 3354 [2019-12-18 15:12:11,727 INFO L226 Difference]: Without dead ends: 3346 [2019-12-18 15:12:11,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:12:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-12-18 15:12:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2160. [2019-12-18 15:12:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2019-12-18 15:12:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 5592 transitions. [2019-12-18 15:12:11,766 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 5592 transitions. Word has length 29 [2019-12-18 15:12:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:11,766 INFO L462 AbstractCegarLoop]: Abstraction has 2160 states and 5592 transitions. [2019-12-18 15:12:11,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:12:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 5592 transitions. [2019-12-18 15:12:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:12:11,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:11,770 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] [2019-12-18 15:12:11,770 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:11,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:11,770 INFO L82 PathProgramCache]: Analyzing trace with hash 804701306, now seen corresponding path program 1 times [2019-12-18 15:12:11,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:11,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380969614] [2019-12-18 15:12:11,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:11,810 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 15:12:11,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380969614] [2019-12-18 15:12:11,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:11,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:12:11,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082873322] [2019-12-18 15:12:11,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:12:11,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:11,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:12:11,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:12:11,813 INFO L87 Difference]: Start difference. First operand 2160 states and 5592 transitions. Second operand 3 states. [2019-12-18 15:12:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:11,830 INFO L93 Difference]: Finished difference Result 3414 states and 8503 transitions. [2019-12-18 15:12:11,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:12:11,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-18 15:12:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:11,834 INFO L225 Difference]: With dead ends: 3414 [2019-12-18 15:12:11,834 INFO L226 Difference]: Without dead ends: 2182 [2019-12-18 15:12:11,835 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 15:12:11,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2019-12-18 15:12:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2154. [2019-12-18 15:12:11,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2019-12-18 15:12:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 5480 transitions. [2019-12-18 15:12:11,866 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 5480 transitions. Word has length 30 [2019-12-18 15:12:11,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:11,867 INFO L462 AbstractCegarLoop]: Abstraction has 2154 states and 5480 transitions. [2019-12-18 15:12:11,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:12:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 5480 transitions. [2019-12-18 15:12:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:12:11,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:11,870 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] [2019-12-18 15:12:11,870 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:11,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:11,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1852558596, now seen corresponding path program 2 times [2019-12-18 15:12:11,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:11,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466011205] [2019-12-18 15:12:11,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:11,938 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 15:12:11,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466011205] [2019-12-18 15:12:11,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:11,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:12:11,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820428680] [2019-12-18 15:12:11,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:12:11,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:11,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:12:11,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:12:11,940 INFO L87 Difference]: Start difference. First operand 2154 states and 5480 transitions. Second operand 6 states. [2019-12-18 15:12:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:12,021 INFO L93 Difference]: Finished difference Result 1348 states and 3559 transitions. [2019-12-18 15:12:12,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:12:12,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-18 15:12:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:12,023 INFO L225 Difference]: With dead ends: 1348 [2019-12-18 15:12:12,024 INFO L226 Difference]: Without dead ends: 1142 [2019-12-18 15:12:12,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:12:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-12-18 15:12:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2019-12-18 15:12:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-12-18 15:12:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 3029 transitions. [2019-12-18 15:12:12,041 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 3029 transitions. Word has length 30 [2019-12-18 15:12:12,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:12,041 INFO L462 AbstractCegarLoop]: Abstraction has 1142 states and 3029 transitions. [2019-12-18 15:12:12,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:12:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 3029 transitions. [2019-12-18 15:12:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 15:12:12,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:12,044 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] [2019-12-18 15:12:12,044 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:12,045 INFO L82 PathProgramCache]: Analyzing trace with hash 909005426, now seen corresponding path program 1 times [2019-12-18 15:12:12,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:12,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425274738] [2019-12-18 15:12:12,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:12,081 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 15:12:12,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425274738] [2019-12-18 15:12:12,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:12,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:12:12,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311071513] [2019-12-18 15:12:12,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:12:12,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:12,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:12:12,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:12:12,083 INFO L87 Difference]: Start difference. First operand 1142 states and 3029 transitions. Second operand 3 states. [2019-12-18 15:12:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:12,126 INFO L93 Difference]: Finished difference Result 1340 states and 3414 transitions. [2019-12-18 15:12:12,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:12:12,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-18 15:12:12,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:12,129 INFO L225 Difference]: With dead ends: 1340 [2019-12-18 15:12:12,129 INFO L226 Difference]: Without dead ends: 1340 [2019-12-18 15:12:12,130 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 15:12:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-12-18 15:12:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1192. [2019-12-18 15:12:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-12-18 15:12:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 3078 transitions. [2019-12-18 15:12:12,149 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 3078 transitions. Word has length 45 [2019-12-18 15:12:12,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:12,149 INFO L462 AbstractCegarLoop]: Abstraction has 1192 states and 3078 transitions. [2019-12-18 15:12:12,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:12:12,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 3078 transitions. [2019-12-18 15:12:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 15:12:12,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:12,152 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] [2019-12-18 15:12:12,152 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:12,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:12,153 INFO L82 PathProgramCache]: Analyzing trace with hash -928078620, now seen corresponding path program 1 times [2019-12-18 15:12:12,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:12,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229661960] [2019-12-18 15:12:12,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:12,240 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 15:12:12,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229661960] [2019-12-18 15:12:12,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:12,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:12:12,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071672639] [2019-12-18 15:12:12,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:12:12,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:12,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:12:12,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:12:12,243 INFO L87 Difference]: Start difference. First operand 1192 states and 3078 transitions. Second operand 7 states. [2019-12-18 15:12:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:12,516 INFO L93 Difference]: Finished difference Result 3208 states and 8220 transitions. [2019-12-18 15:12:12,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:12:12,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-18 15:12:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:12,522 INFO L225 Difference]: With dead ends: 3208 [2019-12-18 15:12:12,522 INFO L226 Difference]: Without dead ends: 2140 [2019-12-18 15:12:12,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:12:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-12-18 15:12:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1336. [2019-12-18 15:12:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-12-18 15:12:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3428 transitions. [2019-12-18 15:12:12,549 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3428 transitions. Word has length 45 [2019-12-18 15:12:12,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:12,549 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 3428 transitions. [2019-12-18 15:12:12,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:12:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3428 transitions. [2019-12-18 15:12:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 15:12:12,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:12,553 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] [2019-12-18 15:12:12,554 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1267873360, now seen corresponding path program 2 times [2019-12-18 15:12:12,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:12,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344984364] [2019-12-18 15:12:12,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:12:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:12:12,757 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:12:12,757 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:12:12,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t2580~0.base_31| 1)) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2580~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2580~0.base_31|) |v_ULTIMATE.start_main_~#t2580~0.offset_22| 0)) |v_#memory_int_23|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2580~0.base_31|)) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= |v_ULTIMATE.start_main_~#t2580~0.offset_22| 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2580~0.base_31| 4)) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2580~0.base_31|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t2582~0.offset=|v_ULTIMATE.start_main_~#t2582~0.offset_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_~#t2580~0.base=|v_ULTIMATE.start_main_~#t2580~0.base_31|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_~#t2581~0.offset=|v_ULTIMATE.start_main_~#t2581~0.offset_22|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2581~0.base=|v_ULTIMATE.start_main_~#t2581~0.base_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t2580~0.offset=|v_ULTIMATE.start_main_~#t2580~0.offset_22|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_~#t2582~0.base=|v_ULTIMATE.start_main_~#t2582~0.base_23|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2582~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ULTIMATE.start_main_~#t2581~0.offset, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t2580~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2581~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2580~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2582~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:12:12,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2581~0.base_10|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2581~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2581~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2581~0.base_10|) |v_ULTIMATE.start_main_~#t2581~0.offset_9| 1)) |v_#memory_int_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2581~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t2581~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t2581~0.base_10|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2581~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2581~0.offset=|v_ULTIMATE.start_main_~#t2581~0.offset_9|, ULTIMATE.start_main_~#t2581~0.base=|v_ULTIMATE.start_main_~#t2581~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2581~0.offset, ULTIMATE.start_main_~#t2581~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 15:12:12,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2582~0.base_11| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2582~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2582~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2582~0.base_11| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2582~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t2582~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2582~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2582~0.base_11|) |v_ULTIMATE.start_main_~#t2582~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2582~0.offset=|v_ULTIMATE.start_main_~#t2582~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t2582~0.base=|v_ULTIMATE.start_main_~#t2582~0.base_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2582~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2582~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 15:12:12,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= 0 (mod v_~y$w_buff1_used~0_71 256)) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_16) (= v_P2Thread1of1ForFork2_~arg.offset_16 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16| 1) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_16, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_16, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:12:12,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_10 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_10 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_10, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_10} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 15:12:12,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In9106860 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite8_Out9106860| ~y$w_buff0~0_In9106860) (= |P1Thread1of1ForFork1_#t~ite8_Out9106860| |P1Thread1of1ForFork1_#t~ite9_Out9106860|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In9106860 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In9106860 256))) (= 0 (mod ~y$w_buff0_used~0_In9106860 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In9106860 256) 0))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In9106860| |P1Thread1of1ForFork1_#t~ite8_Out9106860|) (= |P1Thread1of1ForFork1_#t~ite9_Out9106860| ~y$w_buff0~0_In9106860)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In9106860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In9106860, ~y$w_buff0~0=~y$w_buff0~0_In9106860, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In9106860, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In9106860|, ~weak$$choice2~0=~weak$$choice2~0_In9106860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In9106860} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In9106860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In9106860, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out9106860|, ~y$w_buff0~0=~y$w_buff0~0_In9106860, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In9106860, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out9106860|, ~weak$$choice2~0=~weak$$choice2~0_In9106860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In9106860} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 15:12:12,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In842263436 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out842263436| |P1Thread1of1ForFork1_#t~ite14_Out842263436|) (= ~y$w_buff0_used~0_In842263436 |P1Thread1of1ForFork1_#t~ite14_Out842263436|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In842263436 256) 0))) (or (= (mod ~y$w_buff0_used~0_In842263436 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In842263436 256)) .cse0) (and (= 0 (mod ~y$r_buff1_thd2~0_In842263436 256)) .cse0))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite15_Out842263436| ~y$w_buff0_used~0_In842263436) (= |P1Thread1of1ForFork1_#t~ite14_In842263436| |P1Thread1of1ForFork1_#t~ite14_Out842263436|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In842263436, ~y$w_buff0_used~0=~y$w_buff0_used~0_In842263436, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In842263436, ~weak$$choice2~0=~weak$$choice2~0_In842263436, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In842263436|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In842263436} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In842263436, ~y$w_buff0_used~0=~y$w_buff0_used~0_In842263436, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In842263436, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out842263436|, ~weak$$choice2~0=~weak$$choice2~0_In842263436, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out842263436|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In842263436} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 15:12:12,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_16|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 15:12:12,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2037455564 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In2037455564 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite28_Out2037455564|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In2037455564 |P2Thread1of1ForFork2_#t~ite28_Out2037455564|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2037455564, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2037455564} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2037455564, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2037455564, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out2037455564|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 15:12:12,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 15:12:12,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In-489925329 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-489925329 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-489925329 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-489925329 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-489925329 |P2Thread1of1ForFork2_#t~ite29_Out-489925329|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-489925329|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-489925329, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-489925329, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-489925329, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-489925329} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-489925329, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-489925329, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-489925329, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-489925329|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-489925329} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 15:12:12,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-668981281 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-668981281 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out-668981281 ~y$r_buff0_thd3~0_In-668981281)) (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out-668981281 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-668981281, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-668981281} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-668981281, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-668981281|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-668981281} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 15:12:12,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-666642433 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-666642433 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-666642433 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-666642433 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-666642433 |P2Thread1of1ForFork2_#t~ite31_Out-666642433|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-666642433|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-666642433, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-666642433, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-666642433, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-666642433} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-666642433, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-666642433, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-666642433|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-666642433, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-666642433} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 15:12:12,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite31_38| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_37|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 15:12:12,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 15:12:12,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1801955191 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1801955191 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-1801955191| ~y~0_In-1801955191)) (and (= |ULTIMATE.start_main_#t~ite35_Out-1801955191| ~y$w_buff1~0_In-1801955191) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1801955191, ~y~0=~y~0_In-1801955191, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1801955191, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1801955191} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1801955191, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1801955191|, ~y~0=~y~0_In-1801955191, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1801955191, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1801955191} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-18 15:12:12,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-18 15:12:12,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-260508251 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-260508251 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out-260508251|)) (and (= ~y$w_buff0_used~0_In-260508251 |ULTIMATE.start_main_#t~ite37_Out-260508251|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-260508251, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-260508251} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-260508251, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-260508251, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-260508251|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 15:12:12,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-273681398 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-273681398 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-273681398 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-273681398 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-273681398|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-273681398 |ULTIMATE.start_main_#t~ite38_Out-273681398|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-273681398, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-273681398, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-273681398, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-273681398} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-273681398, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-273681398, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-273681398|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-273681398, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-273681398} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 15:12:12,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-971408872 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-971408872 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-971408872 |ULTIMATE.start_main_#t~ite39_Out-971408872|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite39_Out-971408872|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-971408872, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-971408872} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-971408872, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-971408872|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-971408872} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 15:12:12,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1858144958 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1858144958 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1858144958 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1858144958 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1858144958| ~y$r_buff1_thd0~0_In1858144958) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite40_Out1858144958| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1858144958, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1858144958, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1858144958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1858144958} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1858144958|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1858144958, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1858144958, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1858144958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1858144958} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 15:12:12,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 15:12:12,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:12:12 BasicIcfg [2019-12-18 15:12:12,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:12:12,864 INFO L168 Benchmark]: Toolchain (without parser) took 18822.17 ms. Allocated memory was 138.9 MB in the beginning and 962.1 MB in the end (delta: 823.1 MB). Free memory was 102.3 MB in the beginning and 205.2 MB in the end (delta: -102.9 MB). Peak memory consumption was 720.3 MB. Max. memory is 7.1 GB. [2019-12-18 15:12:12,864 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 138.9 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 15:12:12,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.75 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 157.8 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:12:12,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.75 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 155.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:12:12,868 INFO L168 Benchmark]: Boogie Preprocessor took 37.11 ms. Allocated memory is still 203.4 MB. Free memory was 155.0 MB in the beginning and 153.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:12:12,869 INFO L168 Benchmark]: RCFGBuilder took 743.63 ms. Allocated memory is still 203.4 MB. Free memory was 153.1 MB in the beginning and 110.2 MB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:12:12,873 INFO L168 Benchmark]: TraceAbstraction took 17231.48 ms. Allocated memory was 203.4 MB in the beginning and 962.1 MB in the end (delta: 758.6 MB). Free memory was 109.2 MB in the beginning and 205.2 MB in the end (delta: -96.0 MB). Peak memory consumption was 662.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:12:12,881 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 138.9 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 738.75 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 157.8 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.75 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 155.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.11 ms. Allocated memory is still 203.4 MB. Free memory was 155.0 MB in the beginning and 153.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 743.63 ms. Allocated memory is still 203.4 MB. Free memory was 153.1 MB in the beginning and 110.2 MB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17231.48 ms. Allocated memory was 203.4 MB in the beginning and 962.1 MB in the end (delta: 758.6 MB). Free memory was 109.2 MB in the beginning and 205.2 MB in the end (delta: -96.0 MB). Peak memory consumption was 662.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 151 ProgramPointsBefore, 73 ProgramPointsAfterwards, 176 TransitionsBefore, 82 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 20 ChoiceCompositions, 4974 VarBasedMoverChecksPositive, 245 VarBasedMoverChecksNegative, 129 SemBasedMoverChecksPositive, 162 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 63936 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2580, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2581, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2582, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1327 SDtfs, 1496 SDslu, 2293 SDs, 0 SdLazy, 777 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20292occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 8482 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 23716 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...