/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:00:17,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:00:17,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:00:17,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:00:17,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:00:17,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:00:17,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:00:17,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:00:17,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:00:17,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:00:17,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:00:17,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:00:17,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:00:17,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:00:17,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:00:17,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:00:17,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:00:17,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:00:17,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:00:17,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:00:17,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:00:17,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:00:17,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:00:17,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:00:17,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:00:17,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:00:17,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:00:17,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:00:17,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:00:17,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:00:17,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:00:17,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:00:17,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:00:17,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:00:17,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:00:17,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:00:17,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:00:17,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:00:17,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:00:17,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:00:17,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:00:17,816 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 23:00:17,842 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:00:17,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:00:17,851 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:00:17,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:00:17,852 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:00:17,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:00:17,854 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:00:17,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:00:17,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:00:17,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:00:17,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:00:17,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:00:17,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:00:17,855 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:00:17,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:00:17,857 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:00:17,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:00:17,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:00:17,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:00:17,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:00:17,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:00:17,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:00:17,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:00:17,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:00:17,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:00:17,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:00:17,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:00:17,859 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:00:17,859 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 23:00:17,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:00:17,860 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:00:17,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:00:18,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:00:18,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:00:18,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:00:18,172 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:00:18,172 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:00:18,173 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_pso.opt.i [2019-12-27 23:00:18,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23aefcb9b/7b3ad86688704df680087272d9e9da1d/FLAGf29a3fbd1 [2019-12-27 23:00:18,782 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:00:18,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_pso.opt.i [2019-12-27 23:00:18,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23aefcb9b/7b3ad86688704df680087272d9e9da1d/FLAGf29a3fbd1 [2019-12-27 23:00:19,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23aefcb9b/7b3ad86688704df680087272d9e9da1d [2019-12-27 23:00:19,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:00:19,085 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:00:19,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:00:19,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:00:19,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:00:19,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19, skipping insertion in model container [2019-12-27 23:00:19,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:00:19,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:00:19,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:00:19,679 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:00:19,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:00:19,851 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:00:19,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19 WrapperNode [2019-12-27 23:00:19,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:00:19,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:00:19,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:00:19,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:00:19,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:00:19,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:00:19,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:00:19,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:00:19,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:00:19,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:00:19,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:00:19,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:00:19,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:00:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:00:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 23:00:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:00:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:00:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 23:00:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 23:00:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 23:00:20,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 23:00:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 23:00:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:00:20,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:00:20,044 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 23:00:20,685 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:00:20,686 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 23:00:20,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:00:20 BoogieIcfgContainer [2019-12-27 23:00:20,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:00:20,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:00:20,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:00:20,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:00:20,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:00:19" (1/3) ... [2019-12-27 23:00:20,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d30da06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:00:20, skipping insertion in model container [2019-12-27 23:00:20,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (2/3) ... [2019-12-27 23:00:20,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d30da06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:00:20, skipping insertion in model container [2019-12-27 23:00:20,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:00:20" (3/3) ... [2019-12-27 23:00:20,696 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_pso.opt.i [2019-12-27 23:00:20,706 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:00:20,706 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:00:20,714 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 23:00:20,715 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:00:20,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,757 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,794 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,794 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,795 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,795 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,796 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,818 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,819 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,819 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,825 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,826 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,843 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 23:00:20,859 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:00:20,859 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:00:20,860 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:00:20,860 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:00:20,860 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:00:20,860 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:00:20,860 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:00:20,860 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:00:20,877 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-27 23:00:20,879 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 23:00:20,983 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 23:00:20,984 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:00:21,000 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 23:00:21,018 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 23:00:21,059 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 23:00:21,060 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:00:21,065 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 23:00:21,078 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 23:00:21,079 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:00:24,039 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 23:00:24,226 INFO L206 etLargeBlockEncoding]: Checked pairs total: 42110 [2019-12-27 23:00:24,227 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 23:00:24,230 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 79 transitions [2019-12-27 23:00:24,581 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6782 states. [2019-12-27 23:00:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states. [2019-12-27 23:00:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 23:00:24,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:24,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 23:00:24,592 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:24,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash 670284731, now seen corresponding path program 1 times [2019-12-27 23:00:24,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:24,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215957771] [2019-12-27 23:00:24,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:00:24,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215957771] [2019-12-27 23:00:24,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:24,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:00:24,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1416714176] [2019-12-27 23:00:24,817 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:24,822 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:24,834 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 23:00:24,835 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:24,837 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:00:24,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:00:24,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:24,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:00:24,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:00:24,851 INFO L87 Difference]: Start difference. First operand 6782 states. Second operand 3 states. [2019-12-27 23:00:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:25,164 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-27 23:00:25,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:00:25,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 23:00:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:25,305 INFO L225 Difference]: With dead ends: 6240 [2019-12-27 23:00:25,306 INFO L226 Difference]: Without dead ends: 5850 [2019-12-27 23:00:25,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:00:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-27 23:00:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-27 23:00:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-27 23:00:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-27 23:00:25,670 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-27 23:00:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:25,671 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-27 23:00:25,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:00:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-27 23:00:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 23:00:25,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:25,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:25,675 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:25,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:25,675 INFO L82 PathProgramCache]: Analyzing trace with hash 509733655, now seen corresponding path program 1 times [2019-12-27 23:00:25,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:25,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747775295] [2019-12-27 23:00:25,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:00:25,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747775295] [2019-12-27 23:00:25,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:25,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:25,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1548665396] [2019-12-27 23:00:25,763 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:25,764 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:25,766 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 23:00:25,766 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:25,767 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:00:25,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:00:25,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:25,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:00:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:00:25,769 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 3 states. [2019-12-27 23:00:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:25,795 INFO L93 Difference]: Finished difference Result 1185 states and 2948 transitions. [2019-12-27 23:00:25,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:00:25,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 23:00:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:25,803 INFO L225 Difference]: With dead ends: 1185 [2019-12-27 23:00:25,803 INFO L226 Difference]: Without dead ends: 1185 [2019-12-27 23:00:25,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:00:25,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-27 23:00:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-12-27 23:00:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-27 23:00:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2948 transitions. [2019-12-27 23:00:25,835 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2948 transitions. Word has length 11 [2019-12-27 23:00:25,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:25,835 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 2948 transitions. [2019-12-27 23:00:25,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:00:25,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2948 transitions. [2019-12-27 23:00:25,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:00:25,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:25,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:25,838 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:25,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:25,838 INFO L82 PathProgramCache]: Analyzing trace with hash 310188947, now seen corresponding path program 1 times [2019-12-27 23:00:25,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:25,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197553212] [2019-12-27 23:00:25,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:00:25,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197553212] [2019-12-27 23:00:25,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:25,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:00:25,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [249883891] [2019-12-27 23:00:25,957 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:25,961 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:25,969 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 23:00:25,969 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:26,022 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:00:26,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:00:26,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:26,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:00:26,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:26,023 INFO L87 Difference]: Start difference. First operand 1185 states and 2948 transitions. Second operand 5 states. [2019-12-27 23:00:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:26,143 INFO L93 Difference]: Finished difference Result 1756 states and 4318 transitions. [2019-12-27 23:00:26,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:00:26,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 23:00:26,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:26,153 INFO L225 Difference]: With dead ends: 1756 [2019-12-27 23:00:26,154 INFO L226 Difference]: Without dead ends: 1756 [2019-12-27 23:00:26,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:26,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-27 23:00:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1300. [2019-12-27 23:00:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-27 23:00:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3182 transitions. [2019-12-27 23:00:26,197 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3182 transitions. Word has length 14 [2019-12-27 23:00:26,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:26,198 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3182 transitions. [2019-12-27 23:00:26,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:00:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3182 transitions. [2019-12-27 23:00:26,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:00:26,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:26,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:26,203 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:26,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:26,203 INFO L82 PathProgramCache]: Analyzing trace with hash 306457384, now seen corresponding path program 1 times [2019-12-27 23:00:26,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:26,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986970979] [2019-12-27 23:00:26,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:26,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:00:26,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986970979] [2019-12-27 23:00:26,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:26,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:26,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1747681921] [2019-12-27 23:00:26,318 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:26,323 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:26,329 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 23:00:26,330 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:26,353 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:00:26,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:00:26,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:26,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:00:26,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:26,355 INFO L87 Difference]: Start difference. First operand 1300 states and 3182 transitions. Second operand 5 states. [2019-12-27 23:00:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:26,617 INFO L93 Difference]: Finished difference Result 1703 states and 4071 transitions. [2019-12-27 23:00:26,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:00:26,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 23:00:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:26,628 INFO L225 Difference]: With dead ends: 1703 [2019-12-27 23:00:26,629 INFO L226 Difference]: Without dead ends: 1703 [2019-12-27 23:00:26,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:00:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-27 23:00:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1513. [2019-12-27 23:00:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-12-27 23:00:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 3661 transitions. [2019-12-27 23:00:26,673 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 3661 transitions. Word has length 14 [2019-12-27 23:00:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:26,674 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 3661 transitions. [2019-12-27 23:00:26,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:00:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 3661 transitions. [2019-12-27 23:00:26,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:00:26,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:26,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:26,675 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:26,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:26,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1161574652, now seen corresponding path program 1 times [2019-12-27 23:00:26,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:26,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902874956] [2019-12-27 23:00:26,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:00:26,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902874956] [2019-12-27 23:00:26,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:26,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:26,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1686457271] [2019-12-27 23:00:26,761 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:26,763 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:26,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 23:00:26,769 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:26,785 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:00:26,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:00:26,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:26,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:00:26,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:26,786 INFO L87 Difference]: Start difference. First operand 1513 states and 3661 transitions. Second operand 5 states. [2019-12-27 23:00:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:26,987 INFO L93 Difference]: Finished difference Result 1972 states and 4699 transitions. [2019-12-27 23:00:26,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:00:26,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 23:00:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:27,000 INFO L225 Difference]: With dead ends: 1972 [2019-12-27 23:00:27,000 INFO L226 Difference]: Without dead ends: 1972 [2019-12-27 23:00:27,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:00:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2019-12-27 23:00:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1607. [2019-12-27 23:00:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-27 23:00:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-12-27 23:00:27,043 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 14 [2019-12-27 23:00:27,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:27,043 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-12-27 23:00:27,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:00:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-12-27 23:00:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 23:00:27,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:27,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:27,046 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:27,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:27,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1039744201, now seen corresponding path program 1 times [2019-12-27 23:00:27,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:27,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955525147] [2019-12-27 23:00:27,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:00:27,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955525147] [2019-12-27 23:00:27,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:27,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:00:27,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [828743109] [2019-12-27 23:00:27,108 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:27,114 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:27,126 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 23:00:27,127 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:27,145 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:00:27,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:00:27,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:27,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:00:27,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:27,146 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 5 states. [2019-12-27 23:00:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:27,175 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-27 23:00:27,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:00:27,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 23:00:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:27,180 INFO L225 Difference]: With dead ends: 772 [2019-12-27 23:00:27,180 INFO L226 Difference]: Without dead ends: 772 [2019-12-27 23:00:27,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-27 23:00:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 722. [2019-12-27 23:00:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-27 23:00:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1628 transitions. [2019-12-27 23:00:27,197 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1628 transitions. Word has length 26 [2019-12-27 23:00:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:27,198 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1628 transitions. [2019-12-27 23:00:27,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:00:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1628 transitions. [2019-12-27 23:00:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:27,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:27,201 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] [2019-12-27 23:00:27,201 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:27,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:27,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1200421068, now seen corresponding path program 1 times [2019-12-27 23:00:27,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:27,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616123101] [2019-12-27 23:00:27,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:00:27,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616123101] [2019-12-27 23:00:27,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:27,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:27,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1110607660] [2019-12-27 23:00:27,307 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:27,320 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:27,353 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 132 transitions. [2019-12-27 23:00:27,353 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:27,369 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:00:27,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:00:27,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:27,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:00:27,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:00:27,373 INFO L87 Difference]: Start difference. First operand 722 states and 1628 transitions. Second operand 4 states. [2019-12-27 23:00:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:27,407 INFO L93 Difference]: Finished difference Result 1140 states and 2599 transitions. [2019-12-27 23:00:27,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:00:27,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 23:00:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:27,411 INFO L225 Difference]: With dead ends: 1140 [2019-12-27 23:00:27,411 INFO L226 Difference]: Without dead ends: 438 [2019-12-27 23:00:27,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:00:27,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-27 23:00:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-12-27 23:00:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-27 23:00:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1004 transitions. [2019-12-27 23:00:27,424 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1004 transitions. Word has length 41 [2019-12-27 23:00:27,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:27,424 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 1004 transitions. [2019-12-27 23:00:27,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:00:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1004 transitions. [2019-12-27 23:00:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:27,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:27,427 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] [2019-12-27 23:00:27,427 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:27,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:27,428 INFO L82 PathProgramCache]: Analyzing trace with hash -647816914, now seen corresponding path program 2 times [2019-12-27 23:00:27,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:27,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789644204] [2019-12-27 23:00:27,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:00:27,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789644204] [2019-12-27 23:00:27,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:27,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:00:27,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1167201834] [2019-12-27 23:00:27,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:27,568 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:27,601 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 118 transitions. [2019-12-27 23:00:27,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:27,801 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:00:27,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:00:27,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:27,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:00:27,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:00:27,802 INFO L87 Difference]: Start difference. First operand 438 states and 1004 transitions. Second operand 9 states. [2019-12-27 23:00:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:29,257 INFO L93 Difference]: Finished difference Result 1932 states and 4318 transitions. [2019-12-27 23:00:29,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 23:00:29,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-27 23:00:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:29,265 INFO L225 Difference]: With dead ends: 1932 [2019-12-27 23:00:29,266 INFO L226 Difference]: Without dead ends: 1257 [2019-12-27 23:00:29,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:00:29,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-12-27 23:00:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 615. [2019-12-27 23:00:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-12-27 23:00:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1397 transitions. [2019-12-27 23:00:29,285 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1397 transitions. Word has length 41 [2019-12-27 23:00:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:29,287 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 1397 transitions. [2019-12-27 23:00:29,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:00:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1397 transitions. [2019-12-27 23:00:29,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:29,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:29,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:29,289 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:29,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:29,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1820287444, now seen corresponding path program 3 times [2019-12-27 23:00:29,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:29,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535573420] [2019-12-27 23:00:29,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:00:29,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535573420] [2019-12-27 23:00:29,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:29,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:00:29,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1647184576] [2019-12-27 23:00:29,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:29,453 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:29,488 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 127 transitions. [2019-12-27 23:00:29,488 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:29,796 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:00:29,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:00:29,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:29,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:00:29,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:00:29,798 INFO L87 Difference]: Start difference. First operand 615 states and 1397 transitions. Second operand 16 states. [2019-12-27 23:00:30,768 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-27 23:00:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:32,653 INFO L93 Difference]: Finished difference Result 1393 states and 2825 transitions. [2019-12-27 23:00:32,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 23:00:32,654 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2019-12-27 23:00:32,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:32,663 INFO L225 Difference]: With dead ends: 1393 [2019-12-27 23:00:32,663 INFO L226 Difference]: Without dead ends: 1393 [2019-12-27 23:00:32,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 23:00:32,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2019-12-27 23:00:32,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 770. [2019-12-27 23:00:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-12-27 23:00:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1651 transitions. [2019-12-27 23:00:32,687 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1651 transitions. Word has length 41 [2019-12-27 23:00:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:32,687 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1651 transitions. [2019-12-27 23:00:32,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:00:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1651 transitions. [2019-12-27 23:00:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:32,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:32,690 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] [2019-12-27 23:00:32,690 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:32,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:32,691 INFO L82 PathProgramCache]: Analyzing trace with hash -560460464, now seen corresponding path program 4 times [2019-12-27 23:00:32,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:32,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563986367] [2019-12-27 23:00:32,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:00:32,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563986367] [2019-12-27 23:00:32,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:32,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:00:32,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1810637784] [2019-12-27 23:00:32,808 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:32,854 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:32,873 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 98 transitions. [2019-12-27 23:00:32,873 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:32,932 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:00:32,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:00:32,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:32,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:00:32,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:00:32,933 INFO L87 Difference]: Start difference. First operand 770 states and 1651 transitions. Second operand 11 states. [2019-12-27 23:00:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:34,653 INFO L93 Difference]: Finished difference Result 2176 states and 4403 transitions. [2019-12-27 23:00:34,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 23:00:34,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-12-27 23:00:34,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:34,660 INFO L225 Difference]: With dead ends: 2176 [2019-12-27 23:00:34,660 INFO L226 Difference]: Without dead ends: 1328 [2019-12-27 23:00:34,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=590, Invalid=1860, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 23:00:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2019-12-27 23:00:34,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 736. [2019-12-27 23:00:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-27 23:00:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1541 transitions. [2019-12-27 23:00:34,681 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1541 transitions. Word has length 41 [2019-12-27 23:00:34,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:34,682 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1541 transitions. [2019-12-27 23:00:34,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:00:34,682 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1541 transitions. [2019-12-27 23:00:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:34,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:34,684 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] [2019-12-27 23:00:34,685 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:34,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:34,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1278508734, now seen corresponding path program 5 times [2019-12-27 23:00:34,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:34,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907953245] [2019-12-27 23:00:34,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:00:34,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907953245] [2019-12-27 23:00:34,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:34,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:00:34,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1097752651] [2019-12-27 23:00:34,780 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:34,788 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:34,860 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 83 transitions. [2019-12-27 23:00:34,860 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:34,895 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:00:34,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:00:34,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:34,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:00:34,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:00:34,897 INFO L87 Difference]: Start difference. First operand 736 states and 1541 transitions. Second operand 7 states. [2019-12-27 23:00:35,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:35,597 INFO L93 Difference]: Finished difference Result 1078 states and 2198 transitions. [2019-12-27 23:00:35,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:00:35,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 23:00:35,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:35,608 INFO L225 Difference]: With dead ends: 1078 [2019-12-27 23:00:35,608 INFO L226 Difference]: Without dead ends: 1078 [2019-12-27 23:00:35,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:00:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2019-12-27 23:00:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 769. [2019-12-27 23:00:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-12-27 23:00:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1614 transitions. [2019-12-27 23:00:35,626 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1614 transitions. Word has length 41 [2019-12-27 23:00:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:35,626 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1614 transitions. [2019-12-27 23:00:35,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:00:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1614 transitions. [2019-12-27 23:00:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:35,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:35,632 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] [2019-12-27 23:00:35,632 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:35,632 INFO L82 PathProgramCache]: Analyzing trace with hash 297826318, now seen corresponding path program 6 times [2019-12-27 23:00:35,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:35,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892424198] [2019-12-27 23:00:35,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:00:35,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892424198] [2019-12-27 23:00:35,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:35,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:35,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [568315402] [2019-12-27 23:00:35,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:35,729 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:35,759 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 97 transitions. [2019-12-27 23:00:35,760 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:35,761 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:00:35,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:00:35,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:35,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:00:35,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:00:35,763 INFO L87 Difference]: Start difference. First operand 769 states and 1614 transitions. Second operand 3 states. [2019-12-27 23:00:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:35,778 INFO L93 Difference]: Finished difference Result 769 states and 1612 transitions. [2019-12-27 23:00:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:00:35,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 23:00:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:35,782 INFO L225 Difference]: With dead ends: 769 [2019-12-27 23:00:35,783 INFO L226 Difference]: Without dead ends: 769 [2019-12-27 23:00:35,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:00:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-12-27 23:00:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 635. [2019-12-27 23:00:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-12-27 23:00:35,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1353 transitions. [2019-12-27 23:00:35,800 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1353 transitions. Word has length 41 [2019-12-27 23:00:35,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:35,800 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 1353 transitions. [2019-12-27 23:00:35,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:00:35,800 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1353 transitions. [2019-12-27 23:00:35,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 23:00:35,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:35,802 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] [2019-12-27 23:00:35,802 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:35,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:35,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1362148945, now seen corresponding path program 1 times [2019-12-27 23:00:35,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:35,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123205422] [2019-12-27 23:00:35,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:00:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:00:35,959 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:00:35,959 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:00:35,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~x$w_buff0_used~0_94) (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2567~0.base_20| 4)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2567~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2567~0.base_20|) |v_ULTIMATE.start_main_~#t2567~0.offset_16| 0))) (= 0 v_~x$r_buff0_thd2~0_24) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_6| 0) (= v_~x$r_buff1_thd0~0_22 0) (= 0 v_~x$w_buff0~0_24) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2567~0.base_20|) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~y~0_16 0) (= v_~x$r_buff1_thd1~0_39 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2567~0.base_20| 1)) (= v_~x$w_buff1_used~0_56 0) (= 0 v_~x$r_buff0_thd0~0_18) (= v_~x$mem_tmp~0_8 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_7) (= v_~x$flush_delayed~0_12 0) (= v_~x~0_20 0) (= 0 v_~x$r_buff0_thd1~0_66) (= v_~main$tmp_guard1~0_14 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2567~0.base_20|)) (= |v_ULTIMATE.start_main_~#t2567~0.offset_16| 0) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_24, ULTIMATE.start_main_~#t2568~0.base=|v_ULTIMATE.start_main_~#t2568~0.base_21|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_66, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_8, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, #length=|v_#length_15|, ~y~0=v_~y~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_18, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~x$w_buff1~0=v_~x$w_buff1~0_24, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_~#t2567~0.base=|v_ULTIMATE.start_main_~#t2567~0.base_20|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_9|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_22, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ULTIMATE.start_main_~#t2568~0.offset=|v_ULTIMATE.start_main_~#t2568~0.offset_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_~#t2567~0.offset=|v_ULTIMATE.start_main_~#t2567~0.offset_16|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_20, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2568~0.base, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2567~0.base, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2568~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2567~0.offset, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 23:00:35,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L790-1-->L792: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2568~0.base_11| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2568~0.base_11| 1)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2568~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2568~0.base_11|) |v_ULTIMATE.start_main_~#t2568~0.offset_9| 1))) (= 0 |v_ULTIMATE.start_main_~#t2568~0.offset_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2568~0.base_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2568~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2568~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2568~0.base=|v_ULTIMATE.start_main_~#t2568~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2568~0.offset=|v_ULTIMATE.start_main_~#t2568~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2568~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2568~0.offset] because there is no mapped edge [2019-12-27 23:00:35,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_35)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 23:00:35,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L733-->L733-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1368048022 256) 0))) (or (and (= ~x$w_buff0~0_In1368048022 |P0Thread1of1ForFork1_#t~ite9_Out1368048022|) (= |P0Thread1of1ForFork1_#t~ite8_In1368048022| |P0Thread1of1ForFork1_#t~ite8_Out1368048022|) (not .cse0)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1368048022 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1368048022 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In1368048022 256) 0)) (= (mod ~x$w_buff0_used~0_In1368048022 256) 0))) (= ~x$w_buff0~0_In1368048022 |P0Thread1of1ForFork1_#t~ite8_Out1368048022|) (= |P0Thread1of1ForFork1_#t~ite8_Out1368048022| |P0Thread1of1ForFork1_#t~ite9_Out1368048022|) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1368048022, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1368048022, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In1368048022|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1368048022, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1368048022, ~weak$$choice2~0=~weak$$choice2~0_In1368048022, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1368048022} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1368048022, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1368048022, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1368048022|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out1368048022|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1368048022, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1368048022, ~weak$$choice2~0=~weak$$choice2~0_In1368048022, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1368048022} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 23:00:35,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_50)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_10|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 23:00:35,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_14) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 23:00:35,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In136466105 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In136466105 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out136466105|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In136466105 |P1Thread1of1ForFork0_#t~ite28_Out136466105|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In136466105, ~x$w_buff0_used~0=~x$w_buff0_used~0_In136466105} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In136466105, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out136466105|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In136466105} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 23:00:35,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-315512302 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-315512302 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-315512302 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-315512302 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-315512302| ~x$w_buff1_used~0_In-315512302)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-315512302|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-315512302, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-315512302, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-315512302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-315512302} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-315512302, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-315512302, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-315512302, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-315512302|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-315512302} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 23:00:35,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-882526508 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-882526508 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In-882526508 ~x$r_buff0_thd2~0_Out-882526508) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out-882526508) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-882526508, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-882526508} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-882526508|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-882526508, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-882526508} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 23:00:35,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1085627201 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1085627201 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1085627201 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1085627201 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1085627201| ~x$r_buff1_thd2~0_In-1085627201) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-1085627201| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1085627201, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1085627201, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1085627201, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1085627201} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1085627201|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1085627201, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1085627201, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1085627201, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1085627201} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 23:00:35,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L771-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 23:00:35,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 23:00:35,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite35_Out-878098730| |ULTIMATE.start_main_#t~ite34_Out-878098730|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-878098730 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-878098730 256) 0))) (or (and .cse0 (= ~x$w_buff1~0_In-878098730 |ULTIMATE.start_main_#t~ite34_Out-878098730|) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~x~0_In-878098730 |ULTIMATE.start_main_#t~ite34_Out-878098730|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-878098730, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-878098730, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-878098730, ~x~0=~x~0_In-878098730} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-878098730, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-878098730|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-878098730, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-878098730, ~x~0=~x~0_In-878098730, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-878098730|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 23:00:35,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2133418131 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2133418131 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out2133418131| ~x$w_buff0_used~0_In2133418131) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out2133418131|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2133418131, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133418131} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2133418131, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out2133418131|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133418131} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 23:00:35,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In433179814 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In433179814 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In433179814 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In433179814 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In433179814 |ULTIMATE.start_main_#t~ite37_Out433179814|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite37_Out433179814|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In433179814, ~x$w_buff1_used~0=~x$w_buff1_used~0_In433179814, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In433179814, ~x$w_buff0_used~0=~x$w_buff0_used~0_In433179814} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In433179814, ~x$w_buff1_used~0=~x$w_buff1_used~0_In433179814, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out433179814|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In433179814, ~x$w_buff0_used~0=~x$w_buff0_used~0_In433179814} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 23:00:35,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2135338919 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2135338919 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out2135338919|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In2135338919 |ULTIMATE.start_main_#t~ite38_Out2135338919|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2135338919, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2135338919} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2135338919, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out2135338919|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2135338919} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 23:00:35,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-1774296024 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1774296024 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1774296024 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1774296024 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In-1774296024 |ULTIMATE.start_main_#t~ite39_Out-1774296024|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-1774296024|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1774296024, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1774296024, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1774296024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1774296024} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1774296024, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1774296024|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1774296024, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1774296024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1774296024} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 23:00:35,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= v_~x$r_buff1_thd0~0_16 |v_ULTIMATE.start_main_#t~ite39_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 23:00:36,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:00:36 BasicIcfg [2019-12-27 23:00:36,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:00:36,093 INFO L168 Benchmark]: Toolchain (without parser) took 17006.25 ms. Allocated memory was 138.9 MB in the beginning and 444.1 MB in the end (delta: 305.1 MB). Free memory was 101.4 MB in the beginning and 179.7 MB in the end (delta: -78.2 MB). Peak memory consumption was 226.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:36,094 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 23:00:36,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.65 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 159.3 MB in the end (delta: -58.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:36,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.12 ms. Allocated memory is still 203.9 MB. Free memory was 158.6 MB in the beginning and 156.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:36,099 INFO L168 Benchmark]: Boogie Preprocessor took 54.97 ms. Allocated memory is still 203.9 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:36,101 INFO L168 Benchmark]: RCFGBuilder took 710.40 ms. Allocated memory is still 203.9 MB. Free memory was 154.0 MB in the beginning and 113.5 MB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:36,102 INFO L168 Benchmark]: TraceAbstraction took 15400.96 ms. Allocated memory was 203.9 MB in the beginning and 444.1 MB in the end (delta: 240.1 MB). Free memory was 113.5 MB in the beginning and 179.7 MB in the end (delta: -66.2 MB). Peak memory consumption was 173.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:36,110 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.65 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 159.3 MB in the end (delta: -58.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.12 ms. Allocated memory is still 203.9 MB. Free memory was 158.6 MB in the beginning and 156.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.97 ms. Allocated memory is still 203.9 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 710.40 ms. Allocated memory is still 203.9 MB. Free memory was 154.0 MB in the beginning and 113.5 MB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15400.96 ms. Allocated memory was 203.9 MB in the beginning and 444.1 MB in the end (delta: 240.1 MB). Free memory was 113.5 MB in the beginning and 179.7 MB in the end (delta: -66.2 MB). Peak memory consumption was 173.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 134 ProgramPointsBefore, 67 ProgramPointsAfterwards, 162 TransitionsBefore, 79 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 19 ChoiceCompositions, 4002 VarBasedMoverChecksPositive, 149 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 42110 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2567, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2568, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1380 SDtfs, 2239 SDslu, 3763 SDs, 0 SdLazy, 3898 SolverSat, 319 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6782occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 3361 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 36408 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...