/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:06:02,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:06:02,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:06:02,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:06:02,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:06:02,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:06:02,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:06:02,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:06:02,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:06:02,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:06:02,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:06:02,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:06:02,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:06:02,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:06:02,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:06:02,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:06:02,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:06:02,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:06:02,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:06:02,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:06:02,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:06:02,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:06:02,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:06:02,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:06:02,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:06:02,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:06:02,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:06:02,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:06:02,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:06:02,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:06:02,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:06:02,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:06:02,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:06:02,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:06:02,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:06:02,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:06:02,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:06:02,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:06:02,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:06:02,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:06:02,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:06:02,777 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:06:02,804 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:06:02,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:06:02,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:06:02,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:06:02,808 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:06:02,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:06:02,809 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:06:02,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:06:02,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:06:02,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:06:02,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:06:02,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:06:02,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:06:02,810 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:06:02,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:06:02,810 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:06:02,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:06:02,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:06:02,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:06:02,811 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:06:02,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:06:02,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:06:02,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:06:02,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:06:02,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:06:02,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:06:02,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:06:02,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:06:02,813 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:06:02,813 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:06:03,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:06:03,149 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:06:03,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:06:03,157 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:06:03,157 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:06:03,158 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i [2019-12-26 21:06:03,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50e918fc/5b3bd5592f2a407d8c0ae9d34413bf3b/FLAGd46cb704a [2019-12-26 21:06:03,814 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:06:03,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i [2019-12-26 21:06:03,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50e918fc/5b3bd5592f2a407d8c0ae9d34413bf3b/FLAGd46cb704a [2019-12-26 21:06:04,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50e918fc/5b3bd5592f2a407d8c0ae9d34413bf3b [2019-12-26 21:06:04,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:06:04,098 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:06:04,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:06:04,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:06:04,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:06:04,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:06:04" (1/1) ... [2019-12-26 21:06:04,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee3c599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:04, skipping insertion in model container [2019-12-26 21:06:04,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:06:04" (1/1) ... [2019-12-26 21:06:04,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:06:04,181 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:06:04,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:06:04,730 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:06:04,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:06:04,873 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:06:04,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:04 WrapperNode [2019-12-26 21:06:04,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:06:04,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:06:04,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:06:04,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:06:04,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:04" (1/1) ... [2019-12-26 21:06:04,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:04" (1/1) ... [2019-12-26 21:06:04,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:06:04,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:06:04,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:06:04,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:06:04,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:04" (1/1) ... [2019-12-26 21:06:04,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:04" (1/1) ... [2019-12-26 21:06:04,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:04" (1/1) ... [2019-12-26 21:06:04,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:04" (1/1) ... [2019-12-26 21:06:04,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:04" (1/1) ... [2019-12-26 21:06:04,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:04" (1/1) ... [2019-12-26 21:06:04,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:04" (1/1) ... [2019-12-26 21:06:04,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:06:04,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:06:04,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:06:04,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:06:04,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:04" (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-26 21:06:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:06:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:06:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:06:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:06:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:06:05,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:06:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:06:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:06:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:06:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:06:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:06:05,069 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:06:06,030 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:06:06,030 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:06:06,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:06:06 BoogieIcfgContainer [2019-12-26 21:06:06,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:06:06,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:06:06,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:06:06,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:06:06,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:06:04" (1/3) ... [2019-12-26 21:06:06,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a7ad7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:06:06, skipping insertion in model container [2019-12-26 21:06:06,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:06:04" (2/3) ... [2019-12-26 21:06:06,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a7ad7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:06:06, skipping insertion in model container [2019-12-26 21:06:06,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:06:06" (3/3) ... [2019-12-26 21:06:06,041 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_rmo.oepc.i [2019-12-26 21:06:06,069 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:06:06,069 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:06:06,078 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:06:06,079 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:06:06,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,129 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,129 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,177 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,177 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,219 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,221 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,227 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,228 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,231 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:06:06,250 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 21:06:06,267 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:06:06,267 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:06:06,267 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:06:06,267 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:06:06,268 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:06:06,268 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:06:06,268 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:06:06,268 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:06:06,284 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-26 21:06:06,286 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-26 21:06:06,400 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-26 21:06:06,401 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:06:06,419 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-26 21:06:06,452 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-26 21:06:06,516 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-26 21:06:06,516 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:06:06,529 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-26 21:06:06,566 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-26 21:06:06,567 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:06:12,340 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-26 21:06:12,457 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-26 21:06:12,515 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-26 21:06:12,516 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-26 21:06:12,519 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-26 21:06:14,324 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-26 21:06:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-26 21:06:14,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:06:14,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:14,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:06:14,332 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:14,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:14,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-26 21:06:14,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:14,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790596828] [2019-12-26 21:06:14,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:14,612 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-26 21:06:14,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790596828] [2019-12-26 21:06:14,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:14,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:06:14,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430549314] [2019-12-26 21:06:14,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:06:14,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:14,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:06:14,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:06:14,631 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-26 21:06:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:16,072 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-26 21:06:16,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:06:16,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:06:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:16,311 INFO L225 Difference]: With dead ends: 29506 [2019-12-26 21:06:16,312 INFO L226 Difference]: Without dead ends: 27490 [2019-12-26 21:06:16,315 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-26 21:06:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-26 21:06:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-26 21:06:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-26 21:06:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-26 21:06:17,782 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-26 21:06:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:17,782 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-26 21:06:17,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:06:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-26 21:06:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:06:17,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:17,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:17,791 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:17,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:17,791 INFO L82 PathProgramCache]: Analyzing trace with hash -271665278, now seen corresponding path program 1 times [2019-12-26 21:06:17,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:17,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295151629] [2019-12-26 21:06:17,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:17,893 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-26 21:06:17,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295151629] [2019-12-26 21:06:17,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:17,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:06:17,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977711501] [2019-12-26 21:06:17,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:06:17,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:17,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:06:17,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:06:17,896 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 3 states. [2019-12-26 21:06:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:17,974 INFO L93 Difference]: Finished difference Result 3269 states and 8037 transitions. [2019-12-26 21:06:17,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:06:17,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-26 21:06:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:17,984 INFO L225 Difference]: With dead ends: 3269 [2019-12-26 21:06:17,984 INFO L226 Difference]: Without dead ends: 3269 [2019-12-26 21:06:17,985 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-26 21:06:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-12-26 21:06:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3269. [2019-12-26 21:06:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3269 states. [2019-12-26 21:06:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 8037 transitions. [2019-12-26 21:06:18,083 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 8037 transitions. Word has length 11 [2019-12-26 21:06:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:18,084 INFO L462 AbstractCegarLoop]: Abstraction has 3269 states and 8037 transitions. [2019-12-26 21:06:18,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:06:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 8037 transitions. [2019-12-26 21:06:18,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 21:06:18,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:18,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:18,091 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:18,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:18,091 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-26 21:06:18,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:18,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042580218] [2019-12-26 21:06:18,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:18,186 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-26 21:06:18,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042580218] [2019-12-26 21:06:18,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:18,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:06:18,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356870177] [2019-12-26 21:06:18,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:06:18,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:18,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:06:18,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:06:18,189 INFO L87 Difference]: Start difference. First operand 3269 states and 8037 transitions. Second operand 4 states. [2019-12-26 21:06:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:18,579 INFO L93 Difference]: Finished difference Result 4313 states and 10392 transitions. [2019-12-26 21:06:18,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:06:18,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 21:06:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:18,591 INFO L225 Difference]: With dead ends: 4313 [2019-12-26 21:06:18,591 INFO L226 Difference]: Without dead ends: 4313 [2019-12-26 21:06:18,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:06:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2019-12-26 21:06:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4245. [2019-12-26 21:06:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4245 states. [2019-12-26 21:06:18,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 10260 transitions. [2019-12-26 21:06:18,682 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 10260 transitions. Word has length 14 [2019-12-26 21:06:18,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:18,682 INFO L462 AbstractCegarLoop]: Abstraction has 4245 states and 10260 transitions. [2019-12-26 21:06:18,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:06:18,682 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 10260 transitions. [2019-12-26 21:06:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 21:06:18,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:18,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:18,684 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:18,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:18,684 INFO L82 PathProgramCache]: Analyzing trace with hash 566526627, now seen corresponding path program 1 times [2019-12-26 21:06:18,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:18,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974209969] [2019-12-26 21:06:18,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:06:18,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974209969] [2019-12-26 21:06:18,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:18,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:06:18,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781217604] [2019-12-26 21:06:18,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:06:18,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:18,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:06:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:06:18,746 INFO L87 Difference]: Start difference. First operand 4245 states and 10260 transitions. Second operand 3 states. [2019-12-26 21:06:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:18,862 INFO L93 Difference]: Finished difference Result 7552 states and 17381 transitions. [2019-12-26 21:06:18,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:06:18,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 21:06:18,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:18,881 INFO L225 Difference]: With dead ends: 7552 [2019-12-26 21:06:18,881 INFO L226 Difference]: Without dead ends: 7552 [2019-12-26 21:06:18,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:06:18,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7552 states. [2019-12-26 21:06:19,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7552 to 6526. [2019-12-26 21:06:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6526 states. [2019-12-26 21:06:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 15257 transitions. [2019-12-26 21:06:19,036 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 15257 transitions. Word has length 15 [2019-12-26 21:06:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:19,037 INFO L462 AbstractCegarLoop]: Abstraction has 6526 states and 15257 transitions. [2019-12-26 21:06:19,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:06:19,037 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 15257 transitions. [2019-12-26 21:06:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 21:06:19,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:19,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:19,039 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:19,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:19,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1206588916, now seen corresponding path program 1 times [2019-12-26 21:06:19,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:19,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264376731] [2019-12-26 21:06:19,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:19,120 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-26 21:06:19,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264376731] [2019-12-26 21:06:19,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:19,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:06:19,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379069091] [2019-12-26 21:06:19,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:06:19,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:19,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:06:19,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:06:19,122 INFO L87 Difference]: Start difference. First operand 6526 states and 15257 transitions. Second operand 4 states. [2019-12-26 21:06:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:19,415 INFO L93 Difference]: Finished difference Result 7957 states and 18351 transitions. [2019-12-26 21:06:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:06:19,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-26 21:06:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:19,444 INFO L225 Difference]: With dead ends: 7957 [2019-12-26 21:06:19,444 INFO L226 Difference]: Without dead ends: 7957 [2019-12-26 21:06:19,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:06:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2019-12-26 21:06:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 6579. [2019-12-26 21:06:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6579 states. [2019-12-26 21:06:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 15368 transitions. [2019-12-26 21:06:19,576 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 15368 transitions. Word has length 17 [2019-12-26 21:06:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:19,577 INFO L462 AbstractCegarLoop]: Abstraction has 6579 states and 15368 transitions. [2019-12-26 21:06:19,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:06:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 15368 transitions. [2019-12-26 21:06:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:06:19,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:19,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:19,582 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:19,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:19,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1293061293, now seen corresponding path program 1 times [2019-12-26 21:06:19,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:19,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796672697] [2019-12-26 21:06:19,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:19,643 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-26 21:06:19,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796672697] [2019-12-26 21:06:19,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:19,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:06:19,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830146080] [2019-12-26 21:06:19,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:06:19,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:19,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:06:19,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:06:19,645 INFO L87 Difference]: Start difference. First operand 6579 states and 15368 transitions. Second operand 5 states. [2019-12-26 21:06:20,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:20,144 INFO L93 Difference]: Finished difference Result 8876 states and 20253 transitions. [2019-12-26 21:06:20,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:06:20,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 21:06:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:20,167 INFO L225 Difference]: With dead ends: 8876 [2019-12-26 21:06:20,168 INFO L226 Difference]: Without dead ends: 8876 [2019-12-26 21:06:20,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:06:20,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8876 states. [2019-12-26 21:06:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8876 to 8439. [2019-12-26 21:06:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8439 states. [2019-12-26 21:06:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 19387 transitions. [2019-12-26 21:06:20,421 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 19387 transitions. Word has length 27 [2019-12-26 21:06:20,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:20,421 INFO L462 AbstractCegarLoop]: Abstraction has 8439 states and 19387 transitions. [2019-12-26 21:06:20,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:06:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 19387 transitions. [2019-12-26 21:06:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 21:06:20,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:20,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:20,429 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:20,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:20,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1277893089, now seen corresponding path program 1 times [2019-12-26 21:06:20,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:20,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705294528] [2019-12-26 21:06:20,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:20,475 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-26 21:06:20,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705294528] [2019-12-26 21:06:20,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:20,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:06:20,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405814946] [2019-12-26 21:06:20,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:06:20,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:20,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:06:20,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:06:20,481 INFO L87 Difference]: Start difference. First operand 8439 states and 19387 transitions. Second operand 3 states. [2019-12-26 21:06:20,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:20,565 INFO L93 Difference]: Finished difference Result 9584 states and 20860 transitions. [2019-12-26 21:06:20,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:06:20,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-26 21:06:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:20,594 INFO L225 Difference]: With dead ends: 9584 [2019-12-26 21:06:20,595 INFO L226 Difference]: Without dead ends: 9584 [2019-12-26 21:06:20,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:06:20,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9584 states. [2019-12-26 21:06:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9584 to 8440. [2019-12-26 21:06:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8440 states. [2019-12-26 21:06:20,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8440 states to 8440 states and 18504 transitions. [2019-12-26 21:06:20,764 INFO L78 Accepts]: Start accepts. Automaton has 8440 states and 18504 transitions. Word has length 30 [2019-12-26 21:06:20,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:20,765 INFO L462 AbstractCegarLoop]: Abstraction has 8440 states and 18504 transitions. [2019-12-26 21:06:20,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:06:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 8440 states and 18504 transitions. [2019-12-26 21:06:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:06:20,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:20,775 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] [2019-12-26 21:06:20,775 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:20,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1657093328, now seen corresponding path program 1 times [2019-12-26 21:06:20,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:20,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165169123] [2019-12-26 21:06:20,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:20,861 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-26 21:06:20,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165169123] [2019-12-26 21:06:20,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:20,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:06:20,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059906976] [2019-12-26 21:06:20,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:06:20,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:20,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:06:20,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:06:20,864 INFO L87 Difference]: Start difference. First operand 8440 states and 18504 transitions. Second operand 5 states. [2019-12-26 21:06:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:21,313 INFO L93 Difference]: Finished difference Result 9537 states and 20673 transitions. [2019-12-26 21:06:21,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:06:21,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-26 21:06:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:21,331 INFO L225 Difference]: With dead ends: 9537 [2019-12-26 21:06:21,332 INFO L226 Difference]: Without dead ends: 9537 [2019-12-26 21:06:21,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:06:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2019-12-26 21:06:21,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 7558. [2019-12-26 21:06:21,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7558 states. [2019-12-26 21:06:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7558 states to 7558 states and 16717 transitions. [2019-12-26 21:06:21,482 INFO L78 Accepts]: Start accepts. Automaton has 7558 states and 16717 transitions. Word has length 33 [2019-12-26 21:06:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:21,482 INFO L462 AbstractCegarLoop]: Abstraction has 7558 states and 16717 transitions. [2019-12-26 21:06:21,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:06:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 7558 states and 16717 transitions. [2019-12-26 21:06:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:06:21,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:21,495 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] [2019-12-26 21:06:21,495 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1233120795, now seen corresponding path program 1 times [2019-12-26 21:06:21,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:21,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449216792] [2019-12-26 21:06:21,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:21,547 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-26 21:06:21,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449216792] [2019-12-26 21:06:21,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:21,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:06:21,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524251026] [2019-12-26 21:06:21,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:06:21,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:21,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:06:21,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:06:21,549 INFO L87 Difference]: Start difference. First operand 7558 states and 16717 transitions. Second operand 4 states. [2019-12-26 21:06:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:21,580 INFO L93 Difference]: Finished difference Result 5263 states and 11555 transitions. [2019-12-26 21:06:21,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:06:21,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-26 21:06:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:21,591 INFO L225 Difference]: With dead ends: 5263 [2019-12-26 21:06:21,592 INFO L226 Difference]: Without dead ends: 5263 [2019-12-26 21:06:21,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:06:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-12-26 21:06:21,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5159. [2019-12-26 21:06:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-12-26 21:06:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 11362 transitions. [2019-12-26 21:06:21,759 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 11362 transitions. Word has length 39 [2019-12-26 21:06:21,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:21,760 INFO L462 AbstractCegarLoop]: Abstraction has 5159 states and 11362 transitions. [2019-12-26 21:06:21,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:06:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 11362 transitions. [2019-12-26 21:06:21,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 21:06:21,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:21,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:21,773 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:21,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:21,773 INFO L82 PathProgramCache]: Analyzing trace with hash 184713789, now seen corresponding path program 1 times [2019-12-26 21:06:21,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:21,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997042909] [2019-12-26 21:06:21,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:21,883 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-26 21:06:21,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997042909] [2019-12-26 21:06:21,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:21,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:06:21,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491100296] [2019-12-26 21:06:21,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:06:21,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:21,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:06:21,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:06:21,885 INFO L87 Difference]: Start difference. First operand 5159 states and 11362 transitions. Second operand 8 states. [2019-12-26 21:06:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:22,378 INFO L93 Difference]: Finished difference Result 9824 states and 21398 transitions. [2019-12-26 21:06:22,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 21:06:22,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-26 21:06:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:22,390 INFO L225 Difference]: With dead ends: 9824 [2019-12-26 21:06:22,390 INFO L226 Difference]: Without dead ends: 8719 [2019-12-26 21:06:22,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:06:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8719 states. [2019-12-26 21:06:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8719 to 6443. [2019-12-26 21:06:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6443 states. [2019-12-26 21:06:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6443 states to 6443 states and 14388 transitions. [2019-12-26 21:06:22,563 INFO L78 Accepts]: Start accepts. Automaton has 6443 states and 14388 transitions. Word has length 68 [2019-12-26 21:06:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:22,564 INFO L462 AbstractCegarLoop]: Abstraction has 6443 states and 14388 transitions. [2019-12-26 21:06:22,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:06:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6443 states and 14388 transitions. [2019-12-26 21:06:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 21:06:22,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:22,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:22,588 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:22,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:22,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1779092541, now seen corresponding path program 2 times [2019-12-26 21:06:22,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:22,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739865877] [2019-12-26 21:06:22,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:22,737 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-26 21:06:22,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739865877] [2019-12-26 21:06:22,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:22,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:06:22,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028484026] [2019-12-26 21:06:22,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:06:22,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:22,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:06:22,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:06:22,740 INFO L87 Difference]: Start difference. First operand 6443 states and 14388 transitions. Second operand 5 states. [2019-12-26 21:06:22,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:22,865 INFO L93 Difference]: Finished difference Result 9381 states and 20893 transitions. [2019-12-26 21:06:22,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:06:22,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-26 21:06:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:22,875 INFO L225 Difference]: With dead ends: 9381 [2019-12-26 21:06:22,876 INFO L226 Difference]: Without dead ends: 7879 [2019-12-26 21:06:22,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:06:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7879 states. [2019-12-26 21:06:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7879 to 7779. [2019-12-26 21:06:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7779 states. [2019-12-26 21:06:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 17459 transitions. [2019-12-26 21:06:23,008 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 17459 transitions. Word has length 68 [2019-12-26 21:06:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:23,008 INFO L462 AbstractCegarLoop]: Abstraction has 7779 states and 17459 transitions. [2019-12-26 21:06:23,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:06:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 17459 transitions. [2019-12-26 21:06:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 21:06:23,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:23,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:23,028 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:23,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:23,028 INFO L82 PathProgramCache]: Analyzing trace with hash 89330341, now seen corresponding path program 3 times [2019-12-26 21:06:23,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:23,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824643076] [2019-12-26 21:06:23,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:23,164 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-26 21:06:23,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824643076] [2019-12-26 21:06:23,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:23,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:06:23,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937319052] [2019-12-26 21:06:23,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:06:23,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:23,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:06:23,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:06:23,167 INFO L87 Difference]: Start difference. First operand 7779 states and 17459 transitions. Second operand 8 states. [2019-12-26 21:06:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:23,633 INFO L93 Difference]: Finished difference Result 11922 states and 26443 transitions. [2019-12-26 21:06:23,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 21:06:23,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-26 21:06:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:23,647 INFO L225 Difference]: With dead ends: 11922 [2019-12-26 21:06:23,647 INFO L226 Difference]: Without dead ends: 11455 [2019-12-26 21:06:23,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-26 21:06:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11455 states. [2019-12-26 21:06:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11455 to 7833. [2019-12-26 21:06:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7833 states. [2019-12-26 21:06:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7833 states to 7833 states and 17576 transitions. [2019-12-26 21:06:23,895 INFO L78 Accepts]: Start accepts. Automaton has 7833 states and 17576 transitions. Word has length 68 [2019-12-26 21:06:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:23,896 INFO L462 AbstractCegarLoop]: Abstraction has 7833 states and 17576 transitions. [2019-12-26 21:06:23,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:06:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 17576 transitions. [2019-12-26 21:06:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 21:06:23,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:23,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:23,911 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1465739931, now seen corresponding path program 4 times [2019-12-26 21:06:23,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:23,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502480823] [2019-12-26 21:06:23,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:23,976 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-26 21:06:23,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502480823] [2019-12-26 21:06:23,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:23,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:06:23,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169284877] [2019-12-26 21:06:23,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:06:23,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:23,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:06:23,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:06:23,978 INFO L87 Difference]: Start difference. First operand 7833 states and 17576 transitions. Second operand 4 states. [2019-12-26 21:06:24,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:24,023 INFO L93 Difference]: Finished difference Result 8537 states and 19081 transitions. [2019-12-26 21:06:24,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:06:24,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-26 21:06:24,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:24,025 INFO L225 Difference]: With dead ends: 8537 [2019-12-26 21:06:24,025 INFO L226 Difference]: Without dead ends: 890 [2019-12-26 21:06:24,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:06:24,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-12-26 21:06:24,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2019-12-26 21:06:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-26 21:06:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1849 transitions. [2019-12-26 21:06:24,040 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1849 transitions. Word has length 68 [2019-12-26 21:06:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:24,040 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1849 transitions. [2019-12-26 21:06:24,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:06:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1849 transitions. [2019-12-26 21:06:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-26 21:06:24,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:24,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:24,043 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:24,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:24,044 INFO L82 PathProgramCache]: Analyzing trace with hash 542114771, now seen corresponding path program 1 times [2019-12-26 21:06:24,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:24,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978931212] [2019-12-26 21:06:24,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:24,144 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-26 21:06:24,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978931212] [2019-12-26 21:06:24,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:24,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:06:24,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360588620] [2019-12-26 21:06:24,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:06:24,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:24,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:06:24,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:06:24,146 INFO L87 Difference]: Start difference. First operand 890 states and 1849 transitions. Second operand 5 states. [2019-12-26 21:06:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:24,392 INFO L93 Difference]: Finished difference Result 1006 states and 2057 transitions. [2019-12-26 21:06:24,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:06:24,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-26 21:06:24,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:24,395 INFO L225 Difference]: With dead ends: 1006 [2019-12-26 21:06:24,395 INFO L226 Difference]: Without dead ends: 1006 [2019-12-26 21:06:24,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:06:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-12-26 21:06:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 968. [2019-12-26 21:06:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-12-26 21:06:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1990 transitions. [2019-12-26 21:06:24,412 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1990 transitions. Word has length 69 [2019-12-26 21:06:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:24,413 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1990 transitions. [2019-12-26 21:06:24,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:06:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1990 transitions. [2019-12-26 21:06:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-26 21:06:24,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:24,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:24,416 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:24,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:24,416 INFO L82 PathProgramCache]: Analyzing trace with hash 491973003, now seen corresponding path program 2 times [2019-12-26 21:06:24,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:24,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006109732] [2019-12-26 21:06:24,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:24,562 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-26 21:06:24,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006109732] [2019-12-26 21:06:24,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:24,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:06:24,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604723209] [2019-12-26 21:06:24,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:06:24,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:24,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:06:24,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:06:24,564 INFO L87 Difference]: Start difference. First operand 968 states and 1990 transitions. Second operand 7 states. [2019-12-26 21:06:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:25,085 INFO L93 Difference]: Finished difference Result 2788 states and 5827 transitions. [2019-12-26 21:06:25,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:06:25,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-26 21:06:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:25,090 INFO L225 Difference]: With dead ends: 2788 [2019-12-26 21:06:25,091 INFO L226 Difference]: Without dead ends: 2788 [2019-12-26 21:06:25,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:06:25,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2019-12-26 21:06:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 1477. [2019-12-26 21:06:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1477 states. [2019-12-26 21:06:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 3071 transitions. [2019-12-26 21:06:25,121 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 3071 transitions. Word has length 69 [2019-12-26 21:06:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:25,121 INFO L462 AbstractCegarLoop]: Abstraction has 1477 states and 3071 transitions. [2019-12-26 21:06:25,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:06:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 3071 transitions. [2019-12-26 21:06:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-26 21:06:25,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:25,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:25,125 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:25,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:25,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1127812217, now seen corresponding path program 3 times [2019-12-26 21:06:25,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:25,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834445513] [2019-12-26 21:06:25,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:25,243 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-26 21:06:25,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834445513] [2019-12-26 21:06:25,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:25,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:06:25,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533124677] [2019-12-26 21:06:25,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:06:25,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:25,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:06:25,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:06:25,245 INFO L87 Difference]: Start difference. First operand 1477 states and 3071 transitions. Second operand 7 states. [2019-12-26 21:06:25,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:25,894 INFO L93 Difference]: Finished difference Result 3082 states and 6189 transitions. [2019-12-26 21:06:25,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:06:25,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-26 21:06:25,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:25,898 INFO L225 Difference]: With dead ends: 3082 [2019-12-26 21:06:25,899 INFO L226 Difference]: Without dead ends: 3058 [2019-12-26 21:06:25,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:06:25,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2019-12-26 21:06:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 1677. [2019-12-26 21:06:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2019-12-26 21:06:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 3464 transitions. [2019-12-26 21:06:25,935 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 3464 transitions. Word has length 69 [2019-12-26 21:06:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:25,936 INFO L462 AbstractCegarLoop]: Abstraction has 1677 states and 3464 transitions. [2019-12-26 21:06:25,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:06:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 3464 transitions. [2019-12-26 21:06:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-26 21:06:25,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:25,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:06:25,940 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:25,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:25,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1081203753, now seen corresponding path program 4 times [2019-12-26 21:06:25,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:25,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233530874] [2019-12-26 21:06:25,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:26,035 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-26 21:06:26,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233530874] [2019-12-26 21:06:26,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:26,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:06:26,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609442074] [2019-12-26 21:06:26,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:06:26,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:26,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:06:26,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:06:26,037 INFO L87 Difference]: Start difference. First operand 1677 states and 3464 transitions. Second operand 6 states. [2019-12-26 21:06:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:26,358 INFO L93 Difference]: Finished difference Result 1833 states and 3736 transitions. [2019-12-26 21:06:26,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:06:26,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-26 21:06:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:26,361 INFO L225 Difference]: With dead ends: 1833 [2019-12-26 21:06:26,361 INFO L226 Difference]: Without dead ends: 1833 [2019-12-26 21:06:26,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:06:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2019-12-26 21:06:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1684. [2019-12-26 21:06:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2019-12-26 21:06:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3477 transitions. [2019-12-26 21:06:26,388 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3477 transitions. Word has length 69 [2019-12-26 21:06:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:26,389 INFO L462 AbstractCegarLoop]: Abstraction has 1684 states and 3477 transitions. [2019-12-26 21:06:26,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:06:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3477 transitions. [2019-12-26 21:06:26,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-26 21:06:26,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:26,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:26,393 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:26,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:26,393 INFO L82 PathProgramCache]: Analyzing trace with hash 378733993, now seen corresponding path program 1 times [2019-12-26 21:06:26,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:26,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303436593] [2019-12-26 21:06:26,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:26,627 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-26 21:06:26,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303436593] [2019-12-26 21:06:26,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:26,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 21:06:26,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972430711] [2019-12-26 21:06:26,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:06:26,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:26,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:06:26,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:06:26,635 INFO L87 Difference]: Start difference. First operand 1684 states and 3477 transitions. Second operand 12 states. [2019-12-26 21:06:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:27,407 INFO L93 Difference]: Finished difference Result 2453 states and 4897 transitions. [2019-12-26 21:06:27,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:06:27,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-12-26 21:06:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:27,411 INFO L225 Difference]: With dead ends: 2453 [2019-12-26 21:06:27,412 INFO L226 Difference]: Without dead ends: 2453 [2019-12-26 21:06:27,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:06:27,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2019-12-26 21:06:27,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1673. [2019-12-26 21:06:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1673 states. [2019-12-26 21:06:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 3433 transitions. [2019-12-26 21:06:27,431 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 3433 transitions. Word has length 70 [2019-12-26 21:06:27,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:27,432 INFO L462 AbstractCegarLoop]: Abstraction has 1673 states and 3433 transitions. [2019-12-26 21:06:27,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:06:27,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 3433 transitions. [2019-12-26 21:06:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-26 21:06:27,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:27,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:27,434 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:27,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:27,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1282533711, now seen corresponding path program 2 times [2019-12-26 21:06:27,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:27,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487842235] [2019-12-26 21:06:27,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:06:27,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487842235] [2019-12-26 21:06:27,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:27,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:06:27,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69710610] [2019-12-26 21:06:27,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:06:27,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:27,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:06:27,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:06:27,508 INFO L87 Difference]: Start difference. First operand 1673 states and 3433 transitions. Second operand 3 states. [2019-12-26 21:06:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:27,522 INFO L93 Difference]: Finished difference Result 1673 states and 3432 transitions. [2019-12-26 21:06:27,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:06:27,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-26 21:06:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:27,525 INFO L225 Difference]: With dead ends: 1673 [2019-12-26 21:06:27,525 INFO L226 Difference]: Without dead ends: 1673 [2019-12-26 21:06:27,525 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-26 21:06:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-12-26 21:06:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1481. [2019-12-26 21:06:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-12-26 21:06:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 3066 transitions. [2019-12-26 21:06:27,547 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 3066 transitions. Word has length 70 [2019-12-26 21:06:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:27,547 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 3066 transitions. [2019-12-26 21:06:27,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:06:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 3066 transitions. [2019-12-26 21:06:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-26 21:06:27,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:27,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:27,551 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:27,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash 978366752, now seen corresponding path program 1 times [2019-12-26 21:06:27,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:27,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008294271] [2019-12-26 21:06:27,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:06:27,654 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-26 21:06:27,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008294271] [2019-12-26 21:06:27,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:06:27,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:06:27,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386402381] [2019-12-26 21:06:27,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:06:27,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:06:27,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:06:27,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:06:27,656 INFO L87 Difference]: Start difference. First operand 1481 states and 3066 transitions. Second operand 5 states. [2019-12-26 21:06:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:06:27,734 INFO L93 Difference]: Finished difference Result 1639 states and 3382 transitions. [2019-12-26 21:06:27,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:06:27,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-26 21:06:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:06:27,736 INFO L225 Difference]: With dead ends: 1639 [2019-12-26 21:06:27,737 INFO L226 Difference]: Without dead ends: 1639 [2019-12-26 21:06:27,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:06:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-12-26 21:06:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1405. [2019-12-26 21:06:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2019-12-26 21:06:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2911 transitions. [2019-12-26 21:06:27,757 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2911 transitions. Word has length 70 [2019-12-26 21:06:27,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:06:27,757 INFO L462 AbstractCegarLoop]: Abstraction has 1405 states and 2911 transitions. [2019-12-26 21:06:27,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:06:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2911 transitions. [2019-12-26 21:06:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-26 21:06:27,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:06:27,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:06:27,761 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:06:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:06:27,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1762924738, now seen corresponding path program 1 times [2019-12-26 21:06:27,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:06:27,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920598972] [2019-12-26 21:06:27,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:06:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:06:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:06:27,898 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:06:27,899 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:06:27,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~__unbuffered_p1_EBX~0_103) (= v_~y$r_buff1_thd0~0_223 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_19 0) (= v_~y$w_buff0_used~0_997 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EAX~0_104 0) (= v_~y$read_delayed~0_4 0) (= 0 v_~y$r_buff1_thd2~0_319) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t6~0.base_51| 1)) (= v_~y$r_buff0_thd0~0_188 0) (= v_~main$tmp_guard1~0_72 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t6~0.base_51|) (= v_~y$r_buff1_thd1~0_376 0) (= v_~y$w_buff1~0_221 0) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t6~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t6~0.base_51|) |v_ULTIMATE.start_main_~#t6~0.offset_32| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_6|) (= v_~y~0_343 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_597 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t6~0.base_51|) 0) (= v_~y$w_buff1_used~0_499 0) (= 0 v_~__unbuffered_cnt~0_73) (= v_~__unbuffered_p0_EBX~0_80 0) (= 0 v_~y$r_buff0_thd2~0_403) (= |v_ULTIMATE.start_main_~#t6~0.offset_32| 0) (= 0 v_~__unbuffered_p0_EAX~0_104) (= v_~y$flush_delayed~0_191 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t6~0.base_51| 4)) (= v_~weak$$choice2~0_254 0) (= v_~x~0_54 0) (= v_~y$mem_tmp~0_169 0) (= 0 v_~weak$$choice0~0_159) (= 0 v_~y$w_buff0~0_236))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_997, ULTIMATE.start_main_~#t7~0.offset=|v_ULTIMATE.start_main_~#t7~0.offset_18|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_143|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ULTIMATE.start_main_~#t7~0.base=|v_ULTIMATE.start_main_~#t7~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_376, ULTIMATE.start_main_~#t6~0.offset=|v_ULTIMATE.start_main_~#t6~0.offset_32|, ~y$mem_tmp~0=v_~y$mem_tmp~0_169, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_104, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_236, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_597, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_17|, ~y~0=v_~y~0_343, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_103, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_319, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_188, #valid=|v_#valid_74|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_403, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ULTIMATE.start_main_~#t6~0.base=|v_ULTIMATE.start_main_~#t6~0.base_51|, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_223, ~x~0=v_~x~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_499} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t7~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_~#t7~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t6~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t6~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 21:06:27,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t7~0.offset_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t7~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t7~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t7~0.base_11|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t7~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t7~0.base_11|) |v_ULTIMATE.start_main_~#t7~0.offset_10| 1)) |v_#memory_int_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t7~0.base_11| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t7~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t7~0.base=|v_ULTIMATE.start_main_~#t7~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t7~0.offset=|v_ULTIMATE.start_main_~#t7~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t7~0.base, ULTIMATE.start_main_~#t7~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-26 21:06:27,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~y$r_buff1_thd2~0_Out-511602802 ~y$r_buff0_thd2~0_In-511602802) (= ~weak$$choice2~0_Out-511602802 ~y$flush_delayed~0_Out-511602802) (= ~y~0_In-511602802 ~y$mem_tmp~0_Out-511602802) (= ~y$r_buff1_thd0~0_Out-511602802 ~y$r_buff0_thd0~0_In-511602802) (= |P0Thread1of1ForFork1_#t~nondet3_In-511602802| ~weak$$choice0~0_Out-511602802) (= ~y$r_buff0_thd1~0_Out-511602802 1) (= ~weak$$choice2~0_Out-511602802 |P0Thread1of1ForFork1_#t~nondet4_In-511602802|) (= ~y$r_buff0_thd1~0_In-511602802 ~y$r_buff1_thd1~0_Out-511602802) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-511602802 0))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-511602802, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-511602802, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-511602802, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-511602802, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-511602802|, ~y~0=~y~0_In-511602802, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-511602802|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-511602802, ~weak$$choice0~0=~weak$$choice0~0_Out-511602802, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-511602802, ~y$mem_tmp~0=~y$mem_tmp~0_Out-511602802, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-511602802, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-511602802, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-511602802, ~y$flush_delayed~0=~y$flush_delayed~0_Out-511602802, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-511602802, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-511602802|, ~y~0=~y~0_In-511602802, ~weak$$choice2~0=~weak$$choice2~0_Out-511602802, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-511602802|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-511602802} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 21:06:27,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1235448353 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1235448353 256))) (.cse2 (= |P0Thread1of1ForFork1_#t~ite5_Out1235448353| |P0Thread1of1ForFork1_#t~ite6_Out1235448353|))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out1235448353| ~y$w_buff1~0_In1235448353) (or .cse0 .cse1) .cse2) (and (= |P0Thread1of1ForFork1_#t~ite5_Out1235448353| ~y$w_buff0~0_In1235448353) (not .cse1) (not .cse0) .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1235448353, ~y$w_buff1~0=~y$w_buff1~0_In1235448353, ~y$w_buff0~0=~y$w_buff0~0_In1235448353, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1235448353} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1235448353|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1235448353, ~y$w_buff1~0=~y$w_buff1~0_In1235448353, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1235448353|, ~y$w_buff0~0=~y$w_buff0~0_In1235448353, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1235448353} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:06:27,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~y$r_buff0_thd1~0_87 v_~y$r_buff0_thd1~0_86)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_11|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_11|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:06:27,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1369820020 256)))) (or (and .cse0 (= |P0Thread1of1ForFork1_#t~ite25_Out-1369820020| ~y~0_In-1369820020)) (and (not .cse0) (= ~y$mem_tmp~0_In-1369820020 |P0Thread1of1ForFork1_#t~ite25_Out-1369820020|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1369820020, ~y$flush_delayed~0=~y$flush_delayed~0_In-1369820020, ~y~0=~y~0_In-1369820020} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1369820020, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out-1369820020|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1369820020, ~y~0=~y~0_In-1369820020} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-26 21:06:27,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In821641674 256)))) (or (and .cse0 (= |P1Thread1of1ForFork0_#t~ite54_Out821641674| ~y~0_In821641674)) (and (= |P1Thread1of1ForFork0_#t~ite54_Out821641674| ~y$mem_tmp~0_In821641674) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In821641674, ~y$flush_delayed~0=~y$flush_delayed~0_In821641674, ~y~0=~y~0_In821641674} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In821641674, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out821641674|, ~y$flush_delayed~0=~y$flush_delayed~0_In821641674, ~y~0=~y~0_In821641674} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-26 21:06:27,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In337904666 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In337904666 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite28_Out337904666| ~y$w_buff0_used~0_In337904666)) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite28_Out337904666| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In337904666, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In337904666} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In337904666, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out337904666|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In337904666} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-26 21:06:27,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In1433779589 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1433779589 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In1433779589 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1433779589 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite29_Out1433779589| ~y$w_buff1_used~0_In1433779589)) (and (= |P0Thread1of1ForFork1_#t~ite29_Out1433779589| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1433779589, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1433779589, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1433779589, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1433779589} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1433779589, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1433779589, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out1433779589|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1433779589, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1433779589} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-26 21:06:27,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1915242557 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1915242557 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out-1915242557 0)) (and (= ~y$r_buff0_thd1~0_In-1915242557 ~y$r_buff0_thd1~0_Out-1915242557) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1915242557, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1915242557} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1915242557, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1915242557, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out-1915242557|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 21:06:27,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In776114103 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In776114103 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In776114103 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In776114103 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out776114103|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In776114103 |P0Thread1of1ForFork1_#t~ite31_Out776114103|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In776114103, ~y$w_buff0_used~0=~y$w_buff0_used~0_In776114103, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In776114103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In776114103} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In776114103, ~y$w_buff0_used~0=~y$w_buff0_used~0_In776114103, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In776114103, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out776114103|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In776114103} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-26 21:06:27,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_36|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_35|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-26 21:06:27,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In1618561906 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1618561906 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite55_Out1618561906| ~y~0_In1618561906)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite55_Out1618561906| ~y$w_buff1~0_In1618561906)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1618561906, ~y$w_buff1~0=~y$w_buff1~0_In1618561906, ~y~0=~y~0_In1618561906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1618561906} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1618561906, ~y$w_buff1~0=~y$w_buff1~0_In1618561906, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out1618561906|, ~y~0=~y~0_In1618561906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1618561906} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-26 21:06:27,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_76 |v_P1Thread1of1ForFork0_#t~ite55_10|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_10|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_13|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_9|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-26 21:06:27,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1254422846 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1254422846 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out1254422846| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out1254422846| ~y$w_buff0_used~0_In1254422846)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1254422846, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1254422846} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1254422846, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1254422846, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out1254422846|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-26 21:06:27,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In342354471 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In342354471 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In342354471 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In342354471 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite58_Out342354471| ~y$w_buff1_used~0_In342354471)) (and (= 0 |P1Thread1of1ForFork0_#t~ite58_Out342354471|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In342354471, ~y$w_buff0_used~0=~y$w_buff0_used~0_In342354471, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In342354471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In342354471} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In342354471, ~y$w_buff0_used~0=~y$w_buff0_used~0_In342354471, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In342354471, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out342354471|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In342354471} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-26 21:06:27,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1308099244 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1308099244 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite59_Out-1308099244| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite59_Out-1308099244| ~y$r_buff0_thd2~0_In-1308099244)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1308099244, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1308099244} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1308099244, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1308099244, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-1308099244|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-26 21:06:27,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-1390721280 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1390721280 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1390721280 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1390721280 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite60_Out-1390721280| 0)) (and (= |P1Thread1of1ForFork0_#t~ite60_Out-1390721280| ~y$r_buff1_thd2~0_In-1390721280) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1390721280, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1390721280, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1390721280, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1390721280} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1390721280, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1390721280, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-1390721280|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1390721280, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1390721280} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-26 21:06:27,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_192, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 21:06:27,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_18)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:06:27,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite64_Out91470352| |ULTIMATE.start_main_#t~ite63_Out91470352|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In91470352 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In91470352 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In91470352 |ULTIMATE.start_main_#t~ite63_Out91470352|)) (and (= ~y$w_buff1~0_In91470352 |ULTIMATE.start_main_#t~ite63_Out91470352|) .cse0 (not .cse1) (not .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In91470352, ~y~0=~y~0_In91470352, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In91470352, ~y$w_buff1_used~0=~y$w_buff1_used~0_In91470352} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out91470352|, ~y$w_buff1~0=~y$w_buff1~0_In91470352, ~y~0=~y~0_In91470352, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In91470352, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out91470352|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In91470352} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-26 21:06:27,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-684141856 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-684141856 256) 0))) (or (and (= ~y$w_buff0_used~0_In-684141856 |ULTIMATE.start_main_#t~ite65_Out-684141856|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite65_Out-684141856| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-684141856, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-684141856} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-684141856, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-684141856, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-684141856|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-26 21:06:27,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-819057452 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-819057452 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-819057452 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-819057452 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite66_Out-819057452| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out-819057452| ~y$w_buff1_used~0_In-819057452) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-819057452, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-819057452, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-819057452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-819057452} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-819057452, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-819057452, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-819057452|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-819057452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-819057452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-26 21:06:27,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1186204063 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1186204063 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite67_Out1186204063| 0)) (and (= ~y$r_buff0_thd0~0_In1186204063 |ULTIMATE.start_main_#t~ite67_Out1186204063|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1186204063, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1186204063} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1186204063, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1186204063, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1186204063|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-26 21:06:27,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1290430077 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1290430077 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1290430077 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1290430077 256)))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out1290430077| ~y$r_buff1_thd0~0_In1290430077) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out1290430077|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1290430077, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1290430077, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1290430077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1290430077} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1290430077, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1290430077, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1290430077|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1290430077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1290430077} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-26 21:06:27,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~__unbuffered_p0_EBX~0_46 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 1 v_~__unbuffered_p1_EAX~0_72) (= v_~__unbuffered_p1_EBX~0_61 0) (= v_~y$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_82|) (= v_~main$tmp_guard1~0_40 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_81|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:06:28,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:06:28 BasicIcfg [2019-12-26 21:06:28,065 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:06:28,066 INFO L168 Benchmark]: Toolchain (without parser) took 23968.72 ms. Allocated memory was 139.5 MB in the beginning and 845.7 MB in the end (delta: 706.2 MB). Free memory was 102.6 MB in the beginning and 359.6 MB in the end (delta: -257.0 MB). Peak memory consumption was 449.3 MB. Max. memory is 7.1 GB. [2019-12-26 21:06:28,067 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 21:06:28,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.06 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 102.4 MB in the beginning and 155.5 MB in the end (delta: -53.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-26 21:06:28,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.65 ms. Allocated memory is still 202.9 MB. Free memory was 155.5 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:06:28,069 INFO L168 Benchmark]: Boogie Preprocessor took 42.18 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:06:28,069 INFO L168 Benchmark]: RCFGBuilder took 1046.01 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 93.7 MB in the end (delta: 56.7 MB). Peak memory consumption was 56.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:06:28,070 INFO L168 Benchmark]: TraceAbstraction took 22031.68 ms. Allocated memory was 202.9 MB in the beginning and 845.7 MB in the end (delta: 642.8 MB). Free memory was 93.7 MB in the beginning and 359.6 MB in the end (delta: -265.8 MB). Peak memory consumption was 376.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:06:28,073 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.46 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.06 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 102.4 MB in the beginning and 155.5 MB in the end (delta: -53.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.65 ms. Allocated memory is still 202.9 MB. Free memory was 155.5 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.18 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1046.01 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 93.7 MB in the end (delta: 56.7 MB). Peak memory consumption was 56.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22031.68 ms. Allocated memory was 202.9 MB in the beginning and 845.7 MB in the end (delta: 642.8 MB). Free memory was 93.7 MB in the beginning and 359.6 MB in the end (delta: -265.8 MB). Peak memory consumption was 376.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9684 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t6, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] FCALL, FORK 0 pthread_create(&t7, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$w_buff1 = y$w_buff0 [L730] 1 y$w_buff0 = 1 [L731] 1 y$w_buff1_used = y$w_buff0_used [L732] 1 y$w_buff0_used = (_Bool)1 [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 x = 1 [L776] 2 __unbuffered_p1_EAX = x [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 y$flush_delayed = weak$$choice2 [L782] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L784] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L785] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L786] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L789] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L791] 2 y = y$flush_delayed ? y$mem_tmp : y [L792] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 21.6s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4541 SDtfs, 4089 SDslu, 10673 SDs, 0 SdLazy, 4022 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 50 SyntacticMatches, 13 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29658occurred 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: 3.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 16219 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1018 NumberOfCodeBlocks, 1018 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 927 ConstructedInterpolants, 0 QuantifiedInterpolants, 182719 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...