/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/mix012_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:31:22,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:31:22,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:31:22,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:31:22,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:31:22,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:31:22,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:31:22,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:31:22,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:31:22,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:31:22,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:31:22,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:31:22,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:31:22,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:31:22,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:31:22,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:31:22,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:31:22,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:31:22,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:31:22,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:31:22,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:31:22,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:31:22,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:31:22,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:31:22,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:31:22,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:31:22,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:31:22,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:31:22,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:31:22,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:31:22,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:31:22,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:31:22,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:31:22,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:31:22,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:31:22,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:31:22,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:31:22,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:31:22,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:31:22,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:31:22,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:31:22,693 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:31:22,707 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:31:22,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:31:22,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:31:22,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:31:22,709 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:31:22,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:31:22,710 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:31:22,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:31:22,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:31:22,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:31:22,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:31:22,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:31:22,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:31:22,711 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:31:22,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:31:22,711 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:31:22,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:31:22,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:31:22,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:31:22,712 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:31:22,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:31:22,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:31:22,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:31:22,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:31:22,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:31:22,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:31:22,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:31:22,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:31:22,714 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:31:22,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:31:23,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:31:23,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:31:23,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:31:23,024 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:31:23,025 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:31:23,026 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt.i [2019-12-26 21:31:23,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d59f095/2b028c54d7224a2bb2e8d4ff86f1095d/FLAG92a91d270 [2019-12-26 21:31:23,663 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:31:23,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.opt.i [2019-12-26 21:31:23,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d59f095/2b028c54d7224a2bb2e8d4ff86f1095d/FLAG92a91d270 [2019-12-26 21:31:23,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d59f095/2b028c54d7224a2bb2e8d4ff86f1095d [2019-12-26 21:31:23,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:31:23,916 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:31:23,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:31:23,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:31:23,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:31:23,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:31:23" (1/1) ... [2019-12-26 21:31:23,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230b7f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:23, skipping insertion in model container [2019-12-26 21:31:23,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:31:23" (1/1) ... [2019-12-26 21:31:23,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:31:23,995 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:31:24,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:31:24,583 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:31:24,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:31:24,748 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:31:24,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:24 WrapperNode [2019-12-26 21:31:24,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:31:24,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:31:24,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:31:24,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:31:24,759 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:31:24" (1/1) ... [2019-12-26 21:31:24,779 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:31:24" (1/1) ... [2019-12-26 21:31:24,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:31:24,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:31:24,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:31:24,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:31:24,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:24" (1/1) ... [2019-12-26 21:31:24,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:24" (1/1) ... [2019-12-26 21:31:24,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:24" (1/1) ... [2019-12-26 21:31:24,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:24" (1/1) ... [2019-12-26 21:31:24,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:24" (1/1) ... [2019-12-26 21:31:24,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:24" (1/1) ... [2019-12-26 21:31:24,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:24" (1/1) ... [2019-12-26 21:31:24,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:31:24,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:31:24,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:31:24,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:31:24,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:24" (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:31:24,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:31:24,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:31:24,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:31:24,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:31:24,928 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:31:24,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:31:24,929 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:31:24,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:31:24,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:31:24,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:31:24,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:31:24,932 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:31:25,733 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:31:25,733 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:31:25,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:31:25 BoogieIcfgContainer [2019-12-26 21:31:25,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:31:25,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:31:25,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:31:25,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:31:25,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:31:23" (1/3) ... [2019-12-26 21:31:25,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad63fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:31:25, skipping insertion in model container [2019-12-26 21:31:25,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:24" (2/3) ... [2019-12-26 21:31:25,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad63fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:31:25, skipping insertion in model container [2019-12-26 21:31:25,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:31:25" (3/3) ... [2019-12-26 21:31:25,749 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt.i [2019-12-26 21:31:25,758 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:31:25,758 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:31:25,773 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:31:25,774 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:31:25,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,831 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,832 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,891 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,892 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,938 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,939 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,960 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,960 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:25,979 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 21:31:26,000 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:31:26,000 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:31:26,000 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:31:26,000 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:31:26,001 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:31:26,001 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:31:26,001 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:31:26,001 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:31:26,017 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-26 21:31:26,019 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-26 21:31:26,156 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-26 21:31:26,156 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:31:26,175 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-26 21:31:26,202 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-26 21:31:26,284 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-26 21:31:26,284 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:31:26,297 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-26 21:31:26,328 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-26 21:31:26,329 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:31:26,770 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-26 21:31:30,159 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-12-26 21:31:31,314 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-26 21:31:31,734 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 21:31:31,848 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 21:31:31,910 INFO L206 etLargeBlockEncoding]: Checked pairs total: 122314 [2019-12-26 21:31:31,910 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 21:31:31,914 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 126 transitions [2019-12-26 21:31:33,331 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 24222 states. [2019-12-26 21:31:33,333 INFO L276 IsEmpty]: Start isEmpty. Operand 24222 states. [2019-12-26 21:31:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 21:31:33,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:33,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 21:31:33,341 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:33,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:33,348 INFO L82 PathProgramCache]: Analyzing trace with hash 958600405, now seen corresponding path program 1 times [2019-12-26 21:31:33,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:33,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133172049] [2019-12-26 21:31:33,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:33,648 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:31:33,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133172049] [2019-12-26 21:31:33,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:33,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:31:33,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674200153] [2019-12-26 21:31:33,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:33,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:33,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:33,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:33,672 INFO L87 Difference]: Start difference. First operand 24222 states. Second operand 3 states. [2019-12-26 21:31:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:34,271 INFO L93 Difference]: Finished difference Result 24022 states and 85786 transitions. [2019-12-26 21:31:34,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:34,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 21:31:34,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:34,488 INFO L225 Difference]: With dead ends: 24022 [2019-12-26 21:31:34,488 INFO L226 Difference]: Without dead ends: 22482 [2019-12-26 21:31:34,489 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:31:35,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22482 states. [2019-12-26 21:31:36,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22482 to 22482. [2019-12-26 21:31:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22482 states. [2019-12-26 21:31:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22482 states to 22482 states and 80227 transitions. [2019-12-26 21:31:36,626 INFO L78 Accepts]: Start accepts. Automaton has 22482 states and 80227 transitions. Word has length 5 [2019-12-26 21:31:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:36,627 INFO L462 AbstractCegarLoop]: Abstraction has 22482 states and 80227 transitions. [2019-12-26 21:31:36,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 22482 states and 80227 transitions. [2019-12-26 21:31:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:31:36,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:36,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:36,631 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:36,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:36,631 INFO L82 PathProgramCache]: Analyzing trace with hash -131274802, now seen corresponding path program 1 times [2019-12-26 21:31:36,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:36,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669698001] [2019-12-26 21:31:36,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:36,707 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:31:36,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669698001] [2019-12-26 21:31:36,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:36,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:31:36,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462814389] [2019-12-26 21:31:36,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:31:36,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:36,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:31:36,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:31:36,711 INFO L87 Difference]: Start difference. First operand 22482 states and 80227 transitions. Second operand 4 states. [2019-12-26 21:31:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:37,324 INFO L93 Difference]: Finished difference Result 34872 states and 119343 transitions. [2019-12-26 21:31:37,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:31:37,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:31:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:37,479 INFO L225 Difference]: With dead ends: 34872 [2019-12-26 21:31:37,479 INFO L226 Difference]: Without dead ends: 34857 [2019-12-26 21:31:37,480 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:31:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34857 states. [2019-12-26 21:31:40,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34857 to 33973. [2019-12-26 21:31:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33973 states. [2019-12-26 21:31:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33973 states to 33973 states and 117000 transitions. [2019-12-26 21:31:40,178 INFO L78 Accepts]: Start accepts. Automaton has 33973 states and 117000 transitions. Word has length 11 [2019-12-26 21:31:40,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:40,178 INFO L462 AbstractCegarLoop]: Abstraction has 33973 states and 117000 transitions. [2019-12-26 21:31:40,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:31:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand 33973 states and 117000 transitions. [2019-12-26 21:31:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 21:31:40,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:40,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:40,201 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:40,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:40,202 INFO L82 PathProgramCache]: Analyzing trace with hash -570349916, now seen corresponding path program 1 times [2019-12-26 21:31:40,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:40,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642201612] [2019-12-26 21:31:40,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:40,323 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:31:40,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642201612] [2019-12-26 21:31:40,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:40,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:31:40,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402855813] [2019-12-26 21:31:40,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:31:40,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:40,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:31:40,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:31:40,326 INFO L87 Difference]: Start difference. First operand 33973 states and 117000 transitions. Second operand 4 states. [2019-12-26 21:31:40,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:40,777 INFO L93 Difference]: Finished difference Result 43608 states and 147815 transitions. [2019-12-26 21:31:40,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:31:40,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 21:31:40,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:40,911 INFO L225 Difference]: With dead ends: 43608 [2019-12-26 21:31:40,912 INFO L226 Difference]: Without dead ends: 43594 [2019-12-26 21:31:40,912 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:31:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43594 states. [2019-12-26 21:31:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43594 to 39207. [2019-12-26 21:31:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39207 states. [2019-12-26 21:31:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39207 states to 39207 states and 134217 transitions. [2019-12-26 21:31:44,612 INFO L78 Accepts]: Start accepts. Automaton has 39207 states and 134217 transitions. Word has length 14 [2019-12-26 21:31:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:44,613 INFO L462 AbstractCegarLoop]: Abstraction has 39207 states and 134217 transitions. [2019-12-26 21:31:44,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:31:44,613 INFO L276 IsEmpty]: Start isEmpty. Operand 39207 states and 134217 transitions. [2019-12-26 21:31:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 21:31:44,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:44,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:44,618 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:44,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:44,619 INFO L82 PathProgramCache]: Analyzing trace with hash -500949887, now seen corresponding path program 1 times [2019-12-26 21:31:44,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:44,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720616922] [2019-12-26 21:31:44,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:44,690 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:31:44,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720616922] [2019-12-26 21:31:44,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:44,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:44,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142034643] [2019-12-26 21:31:44,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:44,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:44,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:44,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:44,696 INFO L87 Difference]: Start difference. First operand 39207 states and 134217 transitions. Second operand 3 states. [2019-12-26 21:31:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:45,057 INFO L93 Difference]: Finished difference Result 65918 states and 215197 transitions. [2019-12-26 21:31:45,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:45,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 21:31:45,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:45,246 INFO L225 Difference]: With dead ends: 65918 [2019-12-26 21:31:45,246 INFO L226 Difference]: Without dead ends: 65918 [2019-12-26 21:31:45,246 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:31:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65918 states. [2019-12-26 21:31:46,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65918 to 58476. [2019-12-26 21:31:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58476 states. [2019-12-26 21:31:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58476 states to 58476 states and 193967 transitions. [2019-12-26 21:31:47,303 INFO L78 Accepts]: Start accepts. Automaton has 58476 states and 193967 transitions. Word has length 15 [2019-12-26 21:31:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:47,304 INFO L462 AbstractCegarLoop]: Abstraction has 58476 states and 193967 transitions. [2019-12-26 21:31:47,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 58476 states and 193967 transitions. [2019-12-26 21:31:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:31:47,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:47,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:47,310 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:47,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1418364262, now seen corresponding path program 1 times [2019-12-26 21:31:47,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:47,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577733405] [2019-12-26 21:31:47,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:47,348 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:31:47,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577733405] [2019-12-26 21:31:47,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:47,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:31:47,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144173040] [2019-12-26 21:31:47,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:47,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:47,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:47,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:47,350 INFO L87 Difference]: Start difference. First operand 58476 states and 193967 transitions. Second operand 3 states. [2019-12-26 21:31:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:47,568 INFO L93 Difference]: Finished difference Result 55330 states and 183290 transitions. [2019-12-26 21:31:47,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:47,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 21:31:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:47,712 INFO L225 Difference]: With dead ends: 55330 [2019-12-26 21:31:47,712 INFO L226 Difference]: Without dead ends: 55330 [2019-12-26 21:31:47,712 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:31:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55330 states. [2019-12-26 21:31:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55330 to 55330. [2019-12-26 21:31:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55330 states. [2019-12-26 21:31:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55330 states to 55330 states and 183290 transitions. [2019-12-26 21:31:49,541 INFO L78 Accepts]: Start accepts. Automaton has 55330 states and 183290 transitions. Word has length 16 [2019-12-26 21:31:49,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:49,541 INFO L462 AbstractCegarLoop]: Abstraction has 55330 states and 183290 transitions. [2019-12-26 21:31:49,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 55330 states and 183290 transitions. [2019-12-26 21:31:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 21:31:49,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:49,552 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:31:49,552 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:49,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:49,552 INFO L82 PathProgramCache]: Analyzing trace with hash 285364695, now seen corresponding path program 1 times [2019-12-26 21:31:49,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:49,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141199203] [2019-12-26 21:31:49,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:49,631 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:31:49,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141199203] [2019-12-26 21:31:49,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:49,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:31:49,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907233289] [2019-12-26 21:31:49,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:31:49,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:49,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:31:49,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:31:49,634 INFO L87 Difference]: Start difference. First operand 55330 states and 183290 transitions. Second operand 4 states. [2019-12-26 21:31:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:51,714 INFO L93 Difference]: Finished difference Result 68586 states and 223928 transitions. [2019-12-26 21:31:51,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:31:51,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-26 21:31:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:51,843 INFO L225 Difference]: With dead ends: 68586 [2019-12-26 21:31:51,843 INFO L226 Difference]: Without dead ends: 68569 [2019-12-26 21:31:51,843 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:31:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68569 states. [2019-12-26 21:31:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68569 to 56099. [2019-12-26 21:31:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56099 states. [2019-12-26 21:31:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56099 states to 56099 states and 185794 transitions. [2019-12-26 21:31:53,308 INFO L78 Accepts]: Start accepts. Automaton has 56099 states and 185794 transitions. Word has length 17 [2019-12-26 21:31:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:53,309 INFO L462 AbstractCegarLoop]: Abstraction has 56099 states and 185794 transitions. [2019-12-26 21:31:53,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:31:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 56099 states and 185794 transitions. [2019-12-26 21:31:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-26 21:31:53,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:53,322 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] [2019-12-26 21:31:53,322 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:53,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash -762555601, now seen corresponding path program 1 times [2019-12-26 21:31:53,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:53,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321863447] [2019-12-26 21:31:53,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:53,391 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:31:53,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321863447] [2019-12-26 21:31:53,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:53,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:53,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920481841] [2019-12-26 21:31:53,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:31:53,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:53,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:31:53,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:31:53,393 INFO L87 Difference]: Start difference. First operand 56099 states and 185794 transitions. Second operand 5 states. [2019-12-26 21:31:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:54,649 INFO L93 Difference]: Finished difference Result 78809 states and 254697 transitions. [2019-12-26 21:31:54,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:31:54,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-26 21:31:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:54,796 INFO L225 Difference]: With dead ends: 78809 [2019-12-26 21:31:54,796 INFO L226 Difference]: Without dead ends: 78795 [2019-12-26 21:31:54,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:31:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78795 states. [2019-12-26 21:31:58,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78795 to 61307. [2019-12-26 21:31:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61307 states. [2019-12-26 21:31:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61307 states to 61307 states and 202072 transitions. [2019-12-26 21:31:58,162 INFO L78 Accepts]: Start accepts. Automaton has 61307 states and 202072 transitions. Word has length 20 [2019-12-26 21:31:58,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:58,162 INFO L462 AbstractCegarLoop]: Abstraction has 61307 states and 202072 transitions. [2019-12-26 21:31:58,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:31:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 61307 states and 202072 transitions. [2019-12-26 21:31:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-26 21:31:58,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:58,184 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] [2019-12-26 21:31:58,184 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:58,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:58,185 INFO L82 PathProgramCache]: Analyzing trace with hash -915737050, now seen corresponding path program 1 times [2019-12-26 21:31:58,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:58,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124674115] [2019-12-26 21:31:58,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:58,252 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:31:58,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124674115] [2019-12-26 21:31:58,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:58,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:58,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48918274] [2019-12-26 21:31:58,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:31:58,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:58,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:31:58,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:31:58,255 INFO L87 Difference]: Start difference. First operand 61307 states and 202072 transitions. Second operand 4 states. [2019-12-26 21:31:58,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:58,312 INFO L93 Difference]: Finished difference Result 11362 states and 30298 transitions. [2019-12-26 21:31:58,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:31:58,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-26 21:31:58,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:58,321 INFO L225 Difference]: With dead ends: 11362 [2019-12-26 21:31:58,321 INFO L226 Difference]: Without dead ends: 7054 [2019-12-26 21:31:58,321 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:31:58,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7054 states. [2019-12-26 21:31:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7054 to 7010. [2019-12-26 21:31:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7010 states. [2019-12-26 21:31:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7010 states to 7010 states and 16196 transitions. [2019-12-26 21:31:58,392 INFO L78 Accepts]: Start accepts. Automaton has 7010 states and 16196 transitions. Word has length 23 [2019-12-26 21:31:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:58,393 INFO L462 AbstractCegarLoop]: Abstraction has 7010 states and 16196 transitions. [2019-12-26 21:31:58,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:31:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7010 states and 16196 transitions. [2019-12-26 21:31:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 21:31:58,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:58,397 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] [2019-12-26 21:31:58,397 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:58,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:58,398 INFO L82 PathProgramCache]: Analyzing trace with hash 484194479, now seen corresponding path program 1 times [2019-12-26 21:31:58,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:58,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256330809] [2019-12-26 21:31:58,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:58,447 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:31:58,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256330809] [2019-12-26 21:31:58,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:58,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:58,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868148789] [2019-12-26 21:31:58,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:58,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:58,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:58,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:58,449 INFO L87 Difference]: Start difference. First operand 7010 states and 16196 transitions. Second operand 3 states. [2019-12-26 21:31:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:58,524 INFO L93 Difference]: Finished difference Result 7678 states and 16747 transitions. [2019-12-26 21:31:58,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:58,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-26 21:31:58,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:58,533 INFO L225 Difference]: With dead ends: 7678 [2019-12-26 21:31:58,533 INFO L226 Difference]: Without dead ends: 7678 [2019-12-26 21:31:58,533 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:31:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7678 states. [2019-12-26 21:31:58,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7678 to 7092. [2019-12-26 21:31:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7092 states. [2019-12-26 21:31:58,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7092 states to 7092 states and 15530 transitions. [2019-12-26 21:31:58,606 INFO L78 Accepts]: Start accepts. Automaton has 7092 states and 15530 transitions. Word has length 31 [2019-12-26 21:31:58,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:58,607 INFO L462 AbstractCegarLoop]: Abstraction has 7092 states and 15530 transitions. [2019-12-26 21:31:58,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 7092 states and 15530 transitions. [2019-12-26 21:31:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:31:58,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:58,613 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] [2019-12-26 21:31:58,613 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:58,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:58,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1443742418, now seen corresponding path program 1 times [2019-12-26 21:31:58,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:58,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324092596] [2019-12-26 21:31:58,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:59,065 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:31:59,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324092596] [2019-12-26 21:31:59,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:59,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:59,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31148845] [2019-12-26 21:31:59,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:31:59,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:59,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:31:59,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:31:59,068 INFO L87 Difference]: Start difference. First operand 7092 states and 15530 transitions. Second operand 5 states. [2019-12-26 21:31:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:59,436 INFO L93 Difference]: Finished difference Result 8001 states and 17262 transitions. [2019-12-26 21:31:59,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:31:59,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-26 21:31:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:59,450 INFO L225 Difference]: With dead ends: 8001 [2019-12-26 21:31:59,450 INFO L226 Difference]: Without dead ends: 8000 [2019-12-26 21:31:59,451 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:31:59,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8000 states. [2019-12-26 21:31:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8000 to 6268. [2019-12-26 21:31:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6268 states. [2019-12-26 21:31:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 13863 transitions. [2019-12-26 21:31:59,527 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 13863 transitions. Word has length 34 [2019-12-26 21:31:59,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:59,527 INFO L462 AbstractCegarLoop]: Abstraction has 6268 states and 13863 transitions. [2019-12-26 21:31:59,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:31:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 13863 transitions. [2019-12-26 21:31:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 21:31:59,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:59,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:59,535 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:59,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:59,535 INFO L82 PathProgramCache]: Analyzing trace with hash -774360428, now seen corresponding path program 1 times [2019-12-26 21:31:59,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:59,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457773659] [2019-12-26 21:31:59,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:59,600 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:31:59,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457773659] [2019-12-26 21:31:59,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:59,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:59,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831456106] [2019-12-26 21:31:59,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:31:59,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:59,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:31:59,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:31:59,603 INFO L87 Difference]: Start difference. First operand 6268 states and 13863 transitions. Second operand 5 states. [2019-12-26 21:31:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:59,713 INFO L93 Difference]: Finished difference Result 9283 states and 20621 transitions. [2019-12-26 21:31:59,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:31:59,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-26 21:31:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:59,721 INFO L225 Difference]: With dead ends: 9283 [2019-12-26 21:31:59,721 INFO L226 Difference]: Without dead ends: 7431 [2019-12-26 21:31:59,722 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:31:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2019-12-26 21:31:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7431. [2019-12-26 21:31:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7431 states. [2019-12-26 21:31:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7431 states to 7431 states and 16520 transitions. [2019-12-26 21:31:59,810 INFO L78 Accepts]: Start accepts. Automaton has 7431 states and 16520 transitions. Word has length 41 [2019-12-26 21:31:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:59,810 INFO L462 AbstractCegarLoop]: Abstraction has 7431 states and 16520 transitions. [2019-12-26 21:31:59,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:31:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 7431 states and 16520 transitions. [2019-12-26 21:31:59,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 21:31:59,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:59,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:59,824 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:59,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:59,824 INFO L82 PathProgramCache]: Analyzing trace with hash 102105480, now seen corresponding path program 1 times [2019-12-26 21:31:59,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:59,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922853106] [2019-12-26 21:31:59,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:59,913 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:31:59,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922853106] [2019-12-26 21:31:59,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:59,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:31:59,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404700648] [2019-12-26 21:31:59,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:31:59,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:59,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:31:59,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:31:59,915 INFO L87 Difference]: Start difference. First operand 7431 states and 16520 transitions. Second operand 5 states. [2019-12-26 21:32:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:32:00,324 INFO L93 Difference]: Finished difference Result 8540 states and 18759 transitions. [2019-12-26 21:32:00,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:32:00,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-26 21:32:00,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:32:00,335 INFO L225 Difference]: With dead ends: 8540 [2019-12-26 21:32:00,336 INFO L226 Difference]: Without dead ends: 8540 [2019-12-26 21:32:00,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:32:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8540 states. [2019-12-26 21:32:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8540 to 8196. [2019-12-26 21:32:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-12-26 21:32:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 18092 transitions. [2019-12-26 21:32:00,418 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 18092 transitions. Word has length 42 [2019-12-26 21:32:00,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:32:00,418 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 18092 transitions. [2019-12-26 21:32:00,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:32:00,419 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 18092 transitions. [2019-12-26 21:32:00,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-26 21:32:00,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:32:00,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:32:00,427 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:32:00,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:32:00,428 INFO L82 PathProgramCache]: Analyzing trace with hash -743886017, now seen corresponding path program 1 times [2019-12-26 21:32:00,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:32:00,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079593491] [2019-12-26 21:32:00,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:32:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:32:00,516 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:32:00,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079593491] [2019-12-26 21:32:00,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:32:00,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:32:00,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942915] [2019-12-26 21:32:00,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:32:00,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:32:00,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:32:00,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:32:00,518 INFO L87 Difference]: Start difference. First operand 8196 states and 18092 transitions. Second operand 5 states. [2019-12-26 21:32:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:32:00,865 INFO L93 Difference]: Finished difference Result 9041 states and 19641 transitions. [2019-12-26 21:32:00,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:32:00,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-26 21:32:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:32:00,874 INFO L225 Difference]: With dead ends: 9041 [2019-12-26 21:32:00,874 INFO L226 Difference]: Without dead ends: 9041 [2019-12-26 21:32:00,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:32:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9041 states. [2019-12-26 21:32:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9041 to 8167. [2019-12-26 21:32:00,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8167 states. [2019-12-26 21:32:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8167 states to 8167 states and 17685 transitions. [2019-12-26 21:32:00,960 INFO L78 Accepts]: Start accepts. Automaton has 8167 states and 17685 transitions. Word has length 43 [2019-12-26 21:32:00,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:32:00,960 INFO L462 AbstractCegarLoop]: Abstraction has 8167 states and 17685 transitions. [2019-12-26 21:32:00,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:32:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8167 states and 17685 transitions. [2019-12-26 21:32:00,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-26 21:32:00,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:32:00,969 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] [2019-12-26 21:32:00,969 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:32:00,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:32:00,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2031288696, now seen corresponding path program 1 times [2019-12-26 21:32:00,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:32:00,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259788741] [2019-12-26 21:32:00,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:32:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:32:01,062 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:32:01,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259788741] [2019-12-26 21:32:01,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:32:01,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:32:01,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371259920] [2019-12-26 21:32:01,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:32:01,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:32:01,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:32:01,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:32:01,065 INFO L87 Difference]: Start difference. First operand 8167 states and 17685 transitions. Second operand 5 states. [2019-12-26 21:32:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:32:01,117 INFO L93 Difference]: Finished difference Result 5420 states and 11591 transitions. [2019-12-26 21:32:01,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:32:01,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-26 21:32:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:32:01,124 INFO L225 Difference]: With dead ends: 5420 [2019-12-26 21:32:01,124 INFO L226 Difference]: Without dead ends: 5102 [2019-12-26 21:32:01,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:32:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2019-12-26 21:32:01,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 4812. [2019-12-26 21:32:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4812 states. [2019-12-26 21:32:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 10392 transitions. [2019-12-26 21:32:01,197 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 10392 transitions. Word has length 43 [2019-12-26 21:32:01,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:32:01,198 INFO L462 AbstractCegarLoop]: Abstraction has 4812 states and 10392 transitions. [2019-12-26 21:32:01,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:32:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 10392 transitions. [2019-12-26 21:32:01,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:32:01,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:32:01,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:32:01,207 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:32:01,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:32:01,207 INFO L82 PathProgramCache]: Analyzing trace with hash -687344087, now seen corresponding path program 1 times [2019-12-26 21:32:01,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:32:01,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317141982] [2019-12-26 21:32:01,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:32:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:32:01,276 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:32:01,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317141982] [2019-12-26 21:32:01,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:32:01,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:32:01,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179488640] [2019-12-26 21:32:01,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:32:01,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:32:01,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:32:01,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:32:01,278 INFO L87 Difference]: Start difference. First operand 4812 states and 10392 transitions. Second operand 4 states. [2019-12-26 21:32:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:32:01,310 INFO L93 Difference]: Finished difference Result 5623 states and 12060 transitions. [2019-12-26 21:32:01,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:32:01,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-26 21:32:01,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:32:01,312 INFO L225 Difference]: With dead ends: 5623 [2019-12-26 21:32:01,312 INFO L226 Difference]: Without dead ends: 878 [2019-12-26 21:32:01,314 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:32:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-12-26 21:32:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2019-12-26 21:32:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-12-26 21:32:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1758 transitions. [2019-12-26 21:32:01,328 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1758 transitions. Word has length 59 [2019-12-26 21:32:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:32:01,328 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1758 transitions. [2019-12-26 21:32:01,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:32:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1758 transitions. [2019-12-26 21:32:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:32:01,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:32:01,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:32:01,330 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:32:01,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:32:01,331 INFO L82 PathProgramCache]: Analyzing trace with hash 472534802, now seen corresponding path program 1 times [2019-12-26 21:32:01,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:32:01,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228404246] [2019-12-26 21:32:01,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:32:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:32:01,458 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:32:01,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228404246] [2019-12-26 21:32:01,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:32:01,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:32:01,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499817651] [2019-12-26 21:32:01,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:32:01,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:32:01,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:32:01,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:32:01,461 INFO L87 Difference]: Start difference. First operand 878 states and 1758 transitions. Second operand 8 states. [2019-12-26 21:32:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:32:01,735 INFO L93 Difference]: Finished difference Result 1818 states and 3479 transitions. [2019-12-26 21:32:01,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 21:32:01,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-26 21:32:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:32:01,737 INFO L225 Difference]: With dead ends: 1818 [2019-12-26 21:32:01,737 INFO L226 Difference]: Without dead ends: 1302 [2019-12-26 21:32:01,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:32:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-12-26 21:32:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 928. [2019-12-26 21:32:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2019-12-26 21:32:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1832 transitions. [2019-12-26 21:32:01,752 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1832 transitions. Word has length 59 [2019-12-26 21:32:01,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:32:01,753 INFO L462 AbstractCegarLoop]: Abstraction has 928 states and 1832 transitions. [2019-12-26 21:32:01,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:32:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1832 transitions. [2019-12-26 21:32:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:32:01,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:32:01,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:32:01,755 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:32:01,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:32:01,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1337355214, now seen corresponding path program 2 times [2019-12-26 21:32:01,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:32:01,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621301640] [2019-12-26 21:32:01,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:32:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:32:01,903 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:32:01,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621301640] [2019-12-26 21:32:01,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:32:01,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:32:01,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636366625] [2019-12-26 21:32:01,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:32:01,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:32:01,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:32:01,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:32:01,905 INFO L87 Difference]: Start difference. First operand 928 states and 1832 transitions. Second operand 9 states. [2019-12-26 21:32:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:32:02,747 INFO L93 Difference]: Finished difference Result 1439 states and 2757 transitions. [2019-12-26 21:32:02,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:32:02,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-12-26 21:32:02,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:32:02,750 INFO L225 Difference]: With dead ends: 1439 [2019-12-26 21:32:02,750 INFO L226 Difference]: Without dead ends: 1439 [2019-12-26 21:32:02,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:32:02,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2019-12-26 21:32:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 937. [2019-12-26 21:32:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-12-26 21:32:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1850 transitions. [2019-12-26 21:32:02,761 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1850 transitions. Word has length 59 [2019-12-26 21:32:02,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:32:02,762 INFO L462 AbstractCegarLoop]: Abstraction has 937 states and 1850 transitions. [2019-12-26 21:32:02,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:32:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1850 transitions. [2019-12-26 21:32:02,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:32:02,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:32:02,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:32:02,764 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:32:02,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:32:02,764 INFO L82 PathProgramCache]: Analyzing trace with hash -656253202, now seen corresponding path program 3 times [2019-12-26 21:32:02,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:32:02,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961026528] [2019-12-26 21:32:02,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:32:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:32:02,841 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:32:02,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961026528] [2019-12-26 21:32:02,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:32:02,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:32:02,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842791914] [2019-12-26 21:32:02,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:32:02,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:32:02,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:32:02,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:32:02,843 INFO L87 Difference]: Start difference. First operand 937 states and 1850 transitions. Second operand 6 states. [2019-12-26 21:32:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:32:03,224 INFO L93 Difference]: Finished difference Result 1145 states and 2216 transitions. [2019-12-26 21:32:03,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:32:03,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-26 21:32:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:32:03,226 INFO L225 Difference]: With dead ends: 1145 [2019-12-26 21:32:03,226 INFO L226 Difference]: Without dead ends: 1145 [2019-12-26 21:32:03,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 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:32:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2019-12-26 21:32:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 967. [2019-12-26 21:32:03,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2019-12-26 21:32:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1905 transitions. [2019-12-26 21:32:03,237 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1905 transitions. Word has length 59 [2019-12-26 21:32:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:32:03,237 INFO L462 AbstractCegarLoop]: Abstraction has 967 states and 1905 transitions. [2019-12-26 21:32:03,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:32:03,237 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1905 transitions. [2019-12-26 21:32:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:32:03,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:32:03,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:32:03,239 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:32:03,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:32:03,239 INFO L82 PathProgramCache]: Analyzing trace with hash -308873018, now seen corresponding path program 4 times [2019-12-26 21:32:03,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:32:03,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955513717] [2019-12-26 21:32:03,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:32:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:32:03,316 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:32:03,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955513717] [2019-12-26 21:32:03,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:32:03,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:32:03,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342238139] [2019-12-26 21:32:03,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:32:03,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:32:03,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:32:03,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:32:03,318 INFO L87 Difference]: Start difference. First operand 967 states and 1905 transitions. Second operand 3 states. [2019-12-26 21:32:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:32:03,330 INFO L93 Difference]: Finished difference Result 966 states and 1903 transitions. [2019-12-26 21:32:03,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:32:03,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 21:32:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:32:03,332 INFO L225 Difference]: With dead ends: 966 [2019-12-26 21:32:03,332 INFO L226 Difference]: Without dead ends: 966 [2019-12-26 21:32:03,332 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:32:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-12-26 21:32:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 823. [2019-12-26 21:32:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-26 21:32:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1640 transitions. [2019-12-26 21:32:03,343 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1640 transitions. Word has length 59 [2019-12-26 21:32:03,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:32:03,344 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1640 transitions. [2019-12-26 21:32:03,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:32:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1640 transitions. [2019-12-26 21:32:03,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 21:32:03,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:32:03,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:32:03,348 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:32:03,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:32:03,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1424316398, now seen corresponding path program 1 times [2019-12-26 21:32:03,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:32:03,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690864697] [2019-12-26 21:32:03,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:32:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:32:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:32:03,463 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:32:03,463 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:32:03,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] ULTIMATE.startENTRY-->L808: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~x$w_buff0~0_184) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t311~0.base_35|)) (= v_~x$r_buff0_thd0~0_104 0) (= v_~x$flush_delayed~0_211 0) (= 0 v_~x$w_buff1~0_179) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= 0 v_~x~0_237) (= 0 v_~x$mem_tmp~0_172) (= 0 v_~x$r_buff1_thd2~0_289) (= v_~y~0_71 0) (= v_~__unbuffered_p1_EBX~0_59 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~main$tmp_guard1~0_39 0) (= 0 v_~__unbuffered_cnt~0_51) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_189 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_243 0) (= v_~main$tmp_guard0~0_35 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff1_used~0_431) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t311~0.base_35|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t311~0.base_35| 4)) (= (store .cse0 |v_ULTIMATE.start_main_~#t311~0.base_35| 1) |v_#valid_53|) (= v_~x$r_buff0_thd1~0_285 0) (= 0 v_~x$r_buff0_thd2~0_420) (= v_~x$r_buff1_thd1~0_241 0) (= 0 |v_ULTIMATE.start_main_~#t311~0.offset_25|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$w_buff0_used~0_795) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t311~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t311~0.base_35|) |v_ULTIMATE.start_main_~#t311~0.offset_25| 0)) |v_#memory_int_17|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_184, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_285, ~x$flush_delayed~0=v_~x$flush_delayed~0_211, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_20|, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_241, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ~x$mem_tmp~0=v_~x$mem_tmp~0_172, ULTIMATE.start_main_~#t312~0.offset=|v_ULTIMATE.start_main_~#t312~0.offset_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_19|, ~y~0=v_~y~0_71, ULTIMATE.start_main_~#t311~0.offset=|v_ULTIMATE.start_main_~#t311~0.offset_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_59, ~x$w_buff1~0=v_~x$w_buff1~0_179, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_34|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_35|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_431, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_289, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_169|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_35, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_189, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_420, ULTIMATE.start_main_~#t311~0.base=|v_ULTIMATE.start_main_~#t311~0.base_35|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_795, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_79|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_229|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_27|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t312~0.base=|v_ULTIMATE.start_main_~#t312~0.base_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_243, ~x~0=v_~x~0_237, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t312~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t311~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t311~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t312~0.base, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 21:32:03,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L808-1-->L810: Formula: (and (not (= |v_ULTIMATE.start_main_~#t312~0.base_11| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t312~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t312~0.base_11|) |v_ULTIMATE.start_main_~#t312~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t312~0.offset_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t312~0.base_11| 1)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t312~0.base_11|) 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t312~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t312~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t312~0.base=|v_ULTIMATE.start_main_~#t312~0.base_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t312~0.offset=|v_ULTIMATE.start_main_~#t312~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t312~0.base, #length, ULTIMATE.start_main_~#t312~0.offset] because there is no mapped edge [2019-12-26 21:32:03,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_6|) (= 1 v_~x$w_buff0~0_24) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_123) (= v_~x$w_buff0~0_25 v_~x$w_buff1~0_31) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| 1) (= v_~x$w_buff1_used~0_76 v_~x$w_buff0_used~0_124) (= 0 (mod v_~x$w_buff1_used~0_76 256)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_6| v_P1Thread1of1ForFork1_~arg.offset_6)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_25, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~x$w_buff0~0=v_~x$w_buff0~0_24, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~x$w_buff1~0=v_~x$w_buff1~0_31, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 21:32:03,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L770-2-->L770-4: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1553698000 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1553698000 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out1553698000| ~x$w_buff0~0_In1553698000)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out1553698000| ~x$w_buff1~0_In1553698000)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1553698000, ~x$w_buff1~0=~x$w_buff1~0_In1553698000, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1553698000, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1553698000} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1553698000, ~x$w_buff1~0=~x$w_buff1~0_In1553698000, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1553698000, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1553698000|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1553698000} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-26 21:32:03,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L770-4-->L771: Formula: (= v_~x~0_35 |v_P1Thread1of1ForFork1_#t~ite28_14|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_14|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_13|, ~x~0=v_~x~0_35, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-26 21:32:03,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L775-->L776: Formula: (and (= v_~x$r_buff0_thd2~0_206 v_~x$r_buff0_thd2~0_205) (not (= 0 (mod v_~weak$$choice2~0_111 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_206, ~weak$$choice2~0=v_~weak$$choice2~0_111} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_13|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_10|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_12|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_111} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 21:32:03,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1579770097 256)))) (or (and (not .cse0) (= ~x$mem_tmp~0_In-1579770097 |P1Thread1of1ForFork1_#t~ite48_Out-1579770097|)) (and (= ~x~0_In-1579770097 |P1Thread1of1ForFork1_#t~ite48_Out-1579770097|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1579770097, ~x$mem_tmp~0=~x$mem_tmp~0_In-1579770097, ~x~0=~x~0_In-1579770097} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1579770097, ~x$mem_tmp~0=~x$mem_tmp~0_In-1579770097, ~x~0=~x~0_In-1579770097, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1579770097|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-26 21:32:03,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In1063461587 256)))) (or (and .cse0 (= ~x~0_In1063461587 |P0Thread1of1ForFork0_#t~ite25_Out1063461587|)) (and (not .cse0) (= ~x$mem_tmp~0_In1063461587 |P0Thread1of1ForFork0_#t~ite25_Out1063461587|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1063461587, ~x$mem_tmp~0=~x$mem_tmp~0_In1063461587, ~x~0=~x~0_In1063461587} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1063461587|, ~x$flush_delayed~0=~x$flush_delayed~0_In1063461587, ~x$mem_tmp~0=~x$mem_tmp~0_In1063461587, ~x~0=~x~0_In1063461587} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-26 21:32:03,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite25_20| v_~x~0_109) (= v_~x$flush_delayed~0_78 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_109} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-26 21:32:03,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1836175987 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1836175987 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite51_Out-1836175987| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-1836175987| ~x$w_buff0_used~0_In-1836175987)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1836175987, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1836175987} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1836175987|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1836175987, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1836175987} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-26 21:32:03,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L787-->L787-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-2104833640 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-2104833640 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2104833640 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-2104833640 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite52_Out-2104833640| ~x$w_buff1_used~0_In-2104833640)) (and (= |P1Thread1of1ForFork1_#t~ite52_Out-2104833640| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2104833640, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2104833640, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2104833640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2104833640} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-2104833640|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2104833640, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2104833640, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2104833640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2104833640} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-26 21:32:03,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L788-->L789: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1021275776 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1021275776 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out1021275776 ~x$r_buff0_thd2~0_In1021275776)) (and (not .cse1) (not .cse0) (= ~x$r_buff0_thd2~0_Out1021275776 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1021275776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1021275776} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out1021275776|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1021275776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1021275776} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 21:32:03,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-495268454 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-495268454 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-495268454 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-495268454 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite54_Out-495268454| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite54_Out-495268454| ~x$r_buff1_thd2~0_In-495268454) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-495268454, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-495268454, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-495268454, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-495268454} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-495268454, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-495268454, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-495268454|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-495268454, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-495268454} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-26 21:32:03,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= v_~x$r_buff1_thd2~0_141 |v_P1Thread1of1ForFork1_#t~ite54_20|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_20|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_19|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 21:32:03,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L814-->L816-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~x$w_buff0_used~0_229 256)) (= (mod v_~x$r_buff0_thd0~0_27 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 21:32:03,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L816-2-->L816-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1580315578 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1580315578 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In1580315578 |ULTIMATE.start_main_#t~ite57_Out1580315578|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite57_Out1580315578| ~x~0_In1580315578) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1580315578, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1580315578, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1580315578, ~x~0=~x~0_In1580315578} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1580315578, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out1580315578|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1580315578, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1580315578, ~x~0=~x~0_In1580315578} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-26 21:32:03,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L816-4-->L817: Formula: (= v_~x~0_76 |v_ULTIMATE.start_main_#t~ite57_12|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_12|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_8|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_11|, ~x~0=v_~x~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x~0] because there is no mapped edge [2019-12-26 21:32:03,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [906] [906] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1816264985 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1816264985 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1816264985| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1816264985| ~x$w_buff0_used~0_In1816264985)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1816264985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1816264985} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1816264985, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1816264985|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1816264985} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-26 21:32:03,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1760009422 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1760009422 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1760009422 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1760009422 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out-1760009422| ~x$w_buff1_used~0_In-1760009422) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite60_Out-1760009422| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1760009422, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1760009422, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1760009422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1760009422} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1760009422, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1760009422|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1760009422, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1760009422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1760009422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-26 21:32:03,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1850539011 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1850539011 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In1850539011 |ULTIMATE.start_main_#t~ite61_Out1850539011|)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out1850539011|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1850539011, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1850539011} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1850539011, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1850539011|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1850539011} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-26 21:32:03,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1144217983 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1144217983 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1144217983 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-1144217983 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-1144217983| ~x$r_buff1_thd0~0_In-1144217983) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1144217983|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1144217983, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1144217983, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1144217983, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1144217983} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1144217983|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1144217983, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1144217983, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1144217983, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1144217983} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-26 21:32:03,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L820-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= v_~x$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite62_47|) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~__unbuffered_p0_EAX~0_27) (= v_~__unbuffered_p1_EBX~0_35 0) (= 1 v_~__unbuffered_p1_EAX~0_36)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_171, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:32:03,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:32:03 BasicIcfg [2019-12-26 21:32:03,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:32:03,614 INFO L168 Benchmark]: Toolchain (without parser) took 39698.34 ms. Allocated memory was 145.2 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 101.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 243.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:32:03,614 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 21:32:03,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.92 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 157.0 MB in the end (delta: -55.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:32:03,616 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.53 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 153.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-26 21:32:03,617 INFO L168 Benchmark]: Boogie Preprocessor took 38.85 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:32:03,618 INFO L168 Benchmark]: RCFGBuilder took 876.81 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 99.0 MB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:32:03,618 INFO L168 Benchmark]: TraceAbstraction took 37874.92 ms. Allocated memory was 202.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 98.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 182.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:32:03,628 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.44 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 832.92 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 157.0 MB in the end (delta: -55.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.53 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 153.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.85 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 876.81 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 99.0 MB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37874.92 ms. Allocated memory was 202.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 98.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 182.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 178 ProgramPointsBefore, 103 ProgramPointsAfterwards, 227 TransitionsBefore, 126 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 29 ChoiceCompositions, 8870 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 290 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 122314 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L808] FCALL, FORK 0 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L810] FCALL, FORK 0 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L761] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L762] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L763] 2 x$r_buff0_thd2 = (_Bool)1 [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 x$flush_delayed = weak$$choice2 [L769] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L772] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L773] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x = x$flush_delayed ? x$mem_tmp : x [L779] 2 x$flush_delayed = (_Bool)0 [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 1 y = 1 [L730] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L731] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L732] 1 x$flush_delayed = weak$$choice2 [L733] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L735] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L737] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L740] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L818] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L819] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 37.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3787 SDtfs, 3647 SDslu, 6241 SDs, 0 SdLazy, 3049 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 30 SyntacticMatches, 10 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61307occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 47738 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 80523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...