/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:58:50,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:58:50,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:58:50,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:58:50,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:58:50,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:58:50,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:58:50,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:58:50,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:58:50,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:58:50,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:58:50,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:58:50,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:58:50,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:58:50,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:58:50,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:58:50,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:58:50,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:58:50,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:58:50,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:58:50,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:58:50,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:58:50,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:58:50,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:58:50,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:58:50,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:58:50,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:58:50,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:58:50,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:58:50,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:58:50,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:58:50,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:58:50,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:58:50,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:58:50,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:58:50,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:58:50,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:58:50,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:58:50,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:58:50,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:58:50,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:58:50,645 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 04:58:50,668 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:58:50,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:58:50,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:58:50,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:58:50,671 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:58:50,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:58:50,671 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:58:50,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:58:50,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:58:50,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:58:50,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:58:50,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:58:50,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:58:50,674 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:58:50,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:58:50,675 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:58:50,675 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:58:50,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:58:50,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:58:50,676 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:58:50,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:58:50,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:58:50,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:58:50,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:58:50,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:58:50,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:58:50,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:58:50,678 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 04:58:50,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:58:50,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:58:50,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:58:50,998 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:58:51,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:58:51,004 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:58:51,005 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:58:51,006 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_power.opt.i [2019-12-27 04:58:51,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08483d5f8/37dc2519756543b1925730f122c198a6/FLAG66b9f41dd [2019-12-27 04:58:51,647 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:58:51,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_power.opt.i [2019-12-27 04:58:51,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08483d5f8/37dc2519756543b1925730f122c198a6/FLAG66b9f41dd [2019-12-27 04:58:51,862 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08483d5f8/37dc2519756543b1925730f122c198a6 [2019-12-27 04:58:51,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:58:51,877 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:58:51,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:58:51,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:58:51,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:58:51,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:58:51" (1/1) ... [2019-12-27 04:58:51,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb8f213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:51, skipping insertion in model container [2019-12-27 04:58:51,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:58:51" (1/1) ... [2019-12-27 04:58:51,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:58:51,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:58:52,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:58:52,453 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:58:52,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:58:52,614 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:58:52,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:52 WrapperNode [2019-12-27 04:58:52,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:58:52,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:58:52,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:58:52,616 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:58:52,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:52" (1/1) ... [2019-12-27 04:58:52,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:52" (1/1) ... [2019-12-27 04:58:52,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:58:52,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:58:52,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:58:52,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:58:52,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:52" (1/1) ... [2019-12-27 04:58:52,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:52" (1/1) ... [2019-12-27 04:58:52,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:52" (1/1) ... [2019-12-27 04:58:52,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:52" (1/1) ... [2019-12-27 04:58:52,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:52" (1/1) ... [2019-12-27 04:58:52,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:52" (1/1) ... [2019-12-27 04:58:52,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:52" (1/1) ... [2019-12-27 04:58:52,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:58:52,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:58:52,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:58:52,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:58:52,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:58:52,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:58:52,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 04:58:52,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:58:52,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:58:52,819 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 04:58:52,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 04:58:52,819 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 04:58:52,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 04:58:52,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 04:58:52,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:58:52,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:58:52,822 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 04:58:53,646 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:58:53,647 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 04:58:53,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:58:53 BoogieIcfgContainer [2019-12-27 04:58:53,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:58:53,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:58:53,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:58:53,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:58:53,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:58:51" (1/3) ... [2019-12-27 04:58:53,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fb24f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:58:53, skipping insertion in model container [2019-12-27 04:58:53,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:52" (2/3) ... [2019-12-27 04:58:53,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fb24f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:58:53, skipping insertion in model container [2019-12-27 04:58:53,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:58:53" (3/3) ... [2019-12-27 04:58:53,657 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_power.opt.i [2019-12-27 04:58:53,667 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:58:53,668 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:58:53,676 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 04:58:53,677 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:58:53,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,737 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,738 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,759 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,759 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,759 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,789 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,796 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,797 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,800 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:58:53,817 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 04:58:53,837 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:58:53,837 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:58:53,838 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:58:53,838 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:58:53,838 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:58:53,838 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:58:53,838 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:58:53,838 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:58:53,856 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-27 04:58:53,858 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 04:58:53,967 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 04:58:53,967 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:58:53,985 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 04:58:54,019 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 04:58:54,093 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 04:58:54,094 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:58:54,105 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 04:58:54,135 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 04:58:54,136 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 04:58:57,462 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 04:58:57,574 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 04:58:57,621 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130993 [2019-12-27 04:58:57,621 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 04:58:57,625 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 132 transitions [2019-12-27 04:58:59,106 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25458 states. [2019-12-27 04:58:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 25458 states. [2019-12-27 04:58:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 04:58:59,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:58:59,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 04:58:59,115 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:58:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:58:59,121 INFO L82 PathProgramCache]: Analyzing trace with hash 956813976, now seen corresponding path program 1 times [2019-12-27 04:58:59,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:58:59,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646114748] [2019-12-27 04:58:59,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:58:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:58:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:58:59,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646114748] [2019-12-27 04:58:59,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:58:59,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:58:59,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245599114] [2019-12-27 04:58:59,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:58:59,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:58:59,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:58:59,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:58:59,398 INFO L87 Difference]: Start difference. First operand 25458 states. Second operand 3 states. [2019-12-27 04:59:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:00,700 INFO L93 Difference]: Finished difference Result 25190 states and 90319 transitions. [2019-12-27 04:59:00,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:59:00,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 04:59:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:00,901 INFO L225 Difference]: With dead ends: 25190 [2019-12-27 04:59:00,901 INFO L226 Difference]: Without dead ends: 23451 [2019-12-27 04:59:00,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:01,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23451 states. [2019-12-27 04:59:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23451 to 23451. [2019-12-27 04:59:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23451 states. [2019-12-27 04:59:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23451 states to 23451 states and 84020 transitions. [2019-12-27 04:59:02,140 INFO L78 Accepts]: Start accepts. Automaton has 23451 states and 84020 transitions. Word has length 5 [2019-12-27 04:59:02,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:02,141 INFO L462 AbstractCegarLoop]: Abstraction has 23451 states and 84020 transitions. [2019-12-27 04:59:02,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:59:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 23451 states and 84020 transitions. [2019-12-27 04:59:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:59:02,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:02,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:02,146 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:02,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:02,146 INFO L82 PathProgramCache]: Analyzing trace with hash 962344526, now seen corresponding path program 1 times [2019-12-27 04:59:02,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:02,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268465863] [2019-12-27 04:59:02,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:02,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268465863] [2019-12-27 04:59:02,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:02,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:59:02,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42891128] [2019-12-27 04:59:02,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:59:02,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:02,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:59:02,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:59:02,445 INFO L87 Difference]: Start difference. First operand 23451 states and 84020 transitions. Second operand 4 states. [2019-12-27 04:59:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:03,238 INFO L93 Difference]: Finished difference Result 37210 states and 127163 transitions. [2019-12-27 04:59:03,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:59:03,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 04:59:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:03,402 INFO L225 Difference]: With dead ends: 37210 [2019-12-27 04:59:03,403 INFO L226 Difference]: Without dead ends: 37192 [2019-12-27 04:59:03,404 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-27 04:59:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37192 states. [2019-12-27 04:59:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37192 to 36211. [2019-12-27 04:59:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36211 states. [2019-12-27 04:59:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36211 states to 36211 states and 124600 transitions. [2019-12-27 04:59:06,005 INFO L78 Accepts]: Start accepts. Automaton has 36211 states and 124600 transitions. Word has length 11 [2019-12-27 04:59:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:06,006 INFO L462 AbstractCegarLoop]: Abstraction has 36211 states and 124600 transitions. [2019-12-27 04:59:06,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:59:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 36211 states and 124600 transitions. [2019-12-27 04:59:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:59:06,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:06,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:06,013 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:06,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1995967631, now seen corresponding path program 1 times [2019-12-27 04:59:06,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:06,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654751446] [2019-12-27 04:59:06,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:06,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654751446] [2019-12-27 04:59:06,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:06,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:59:06,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011344168] [2019-12-27 04:59:06,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:59:06,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:06,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:59:06,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:59:06,081 INFO L87 Difference]: Start difference. First operand 36211 states and 124600 transitions. Second operand 4 states. [2019-12-27 04:59:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:06,897 INFO L93 Difference]: Finished difference Result 46308 states and 156696 transitions. [2019-12-27 04:59:06,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:59:06,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 04:59:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:07,182 INFO L225 Difference]: With dead ends: 46308 [2019-12-27 04:59:07,182 INFO L226 Difference]: Without dead ends: 46293 [2019-12-27 04:59:07,182 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-27 04:59:07,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46293 states. [2019-12-27 04:59:08,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46293 to 41467. [2019-12-27 04:59:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41467 states. [2019-12-27 04:59:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41467 states to 41467 states and 141767 transitions. [2019-12-27 04:59:09,040 INFO L78 Accepts]: Start accepts. Automaton has 41467 states and 141767 transitions. Word has length 14 [2019-12-27 04:59:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:09,041 INFO L462 AbstractCegarLoop]: Abstraction has 41467 states and 141767 transitions. [2019-12-27 04:59:09,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:59:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 41467 states and 141767 transitions. [2019-12-27 04:59:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:59:09,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:09,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:09,047 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:09,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:09,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1745483184, now seen corresponding path program 1 times [2019-12-27 04:59:09,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:09,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958745999] [2019-12-27 04:59:09,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:09,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958745999] [2019-12-27 04:59:09,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:09,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:09,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70362494] [2019-12-27 04:59:09,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:59:09,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:59:09,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:09,098 INFO L87 Difference]: Start difference. First operand 41467 states and 141767 transitions. Second operand 3 states. [2019-12-27 04:59:10,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:10,755 INFO L93 Difference]: Finished difference Result 67426 states and 220619 transitions. [2019-12-27 04:59:10,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:59:10,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 04:59:10,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:10,948 INFO L225 Difference]: With dead ends: 67426 [2019-12-27 04:59:10,948 INFO L226 Difference]: Without dead ends: 67426 [2019-12-27 04:59:10,949 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-27 04:59:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67426 states. [2019-12-27 04:59:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67426 to 60125. [2019-12-27 04:59:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60125 states. [2019-12-27 04:59:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60125 states to 60125 states and 199866 transitions. [2019-12-27 04:59:13,038 INFO L78 Accepts]: Start accepts. Automaton has 60125 states and 199866 transitions. Word has length 15 [2019-12-27 04:59:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:13,038 INFO L462 AbstractCegarLoop]: Abstraction has 60125 states and 199866 transitions. [2019-12-27 04:59:13,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:59:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 60125 states and 199866 transitions. [2019-12-27 04:59:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 04:59:13,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:13,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:13,044 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:13,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:13,045 INFO L82 PathProgramCache]: Analyzing trace with hash -444032019, now seen corresponding path program 1 times [2019-12-27 04:59:13,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:13,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007753684] [2019-12-27 04:59:13,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:13,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007753684] [2019-12-27 04:59:13,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:13,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:59:13,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275043557] [2019-12-27 04:59:13,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:59:13,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:13,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:59:13,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:13,102 INFO L87 Difference]: Start difference. First operand 60125 states and 199866 transitions. Second operand 3 states. [2019-12-27 04:59:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:13,329 INFO L93 Difference]: Finished difference Result 60022 states and 199539 transitions. [2019-12-27 04:59:13,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:59:13,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 04:59:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:13,468 INFO L225 Difference]: With dead ends: 60022 [2019-12-27 04:59:13,468 INFO L226 Difference]: Without dead ends: 60022 [2019-12-27 04:59:13,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:14,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60022 states. [2019-12-27 04:59:16,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60022 to 60022. [2019-12-27 04:59:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60022 states. [2019-12-27 04:59:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60022 states to 60022 states and 199539 transitions. [2019-12-27 04:59:16,788 INFO L78 Accepts]: Start accepts. Automaton has 60022 states and 199539 transitions. Word has length 16 [2019-12-27 04:59:16,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:16,788 INFO L462 AbstractCegarLoop]: Abstraction has 60022 states and 199539 transitions. [2019-12-27 04:59:16,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:59:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 60022 states and 199539 transitions. [2019-12-27 04:59:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:59:16,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:16,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:16,794 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:16,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:16,794 INFO L82 PathProgramCache]: Analyzing trace with hash -102968596, now seen corresponding path program 1 times [2019-12-27 04:59:16,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:16,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803445268] [2019-12-27 04:59:16,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:16,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803445268] [2019-12-27 04:59:16,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:16,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:59:16,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415796384] [2019-12-27 04:59:16,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:59:16,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:16,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:59:16,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:59:16,857 INFO L87 Difference]: Start difference. First operand 60022 states and 199539 transitions. Second operand 4 states. [2019-12-27 04:59:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:17,817 INFO L93 Difference]: Finished difference Result 73471 states and 240719 transitions. [2019-12-27 04:59:17,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:59:17,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 04:59:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:17,968 INFO L225 Difference]: With dead ends: 73471 [2019-12-27 04:59:17,968 INFO L226 Difference]: Without dead ends: 73454 [2019-12-27 04:59:17,969 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-27 04:59:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73454 states. [2019-12-27 04:59:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73454 to 60574. [2019-12-27 04:59:21,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60574 states. [2019-12-27 04:59:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60574 states to 60574 states and 201407 transitions. [2019-12-27 04:59:21,579 INFO L78 Accepts]: Start accepts. Automaton has 60574 states and 201407 transitions. Word has length 17 [2019-12-27 04:59:21,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:21,579 INFO L462 AbstractCegarLoop]: Abstraction has 60574 states and 201407 transitions. [2019-12-27 04:59:21,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:59:21,580 INFO L276 IsEmpty]: Start isEmpty. Operand 60574 states and 201407 transitions. [2019-12-27 04:59:21,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:59:21,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:21,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:21,586 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:21,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:21,586 INFO L82 PathProgramCache]: Analyzing trace with hash -984006585, now seen corresponding path program 1 times [2019-12-27 04:59:21,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:21,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28387469] [2019-12-27 04:59:21,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:21,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28387469] [2019-12-27 04:59:21,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:21,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:59:21,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233563037] [2019-12-27 04:59:21,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:59:21,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:21,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:59:21,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:21,636 INFO L87 Difference]: Start difference. First operand 60574 states and 201407 transitions. Second operand 3 states. [2019-12-27 04:59:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:21,910 INFO L93 Difference]: Finished difference Result 57003 states and 189266 transitions. [2019-12-27 04:59:21,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:59:21,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 04:59:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:22,064 INFO L225 Difference]: With dead ends: 57003 [2019-12-27 04:59:22,064 INFO L226 Difference]: Without dead ends: 56877 [2019-12-27 04:59:22,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56877 states. [2019-12-27 04:59:23,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56877 to 56877. [2019-12-27 04:59:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56877 states. [2019-12-27 04:59:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56877 states to 56877 states and 188879 transitions. [2019-12-27 04:59:23,812 INFO L78 Accepts]: Start accepts. Automaton has 56877 states and 188879 transitions. Word has length 17 [2019-12-27 04:59:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:23,812 INFO L462 AbstractCegarLoop]: Abstraction has 56877 states and 188879 transitions. [2019-12-27 04:59:23,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:59:23,813 INFO L276 IsEmpty]: Start isEmpty. Operand 56877 states and 188879 transitions. [2019-12-27 04:59:23,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 04:59:23,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:23,823 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-27 04:59:23,823 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:23,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:23,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1689107289, now seen corresponding path program 1 times [2019-12-27 04:59:23,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:23,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511474530] [2019-12-27 04:59:23,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:23,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511474530] [2019-12-27 04:59:23,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:23,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:23,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958854994] [2019-12-27 04:59:23,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:59:23,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:23,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:59:23,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:59:23,894 INFO L87 Difference]: Start difference. First operand 56877 states and 188879 transitions. Second operand 5 states. [2019-12-27 04:59:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:26,655 INFO L93 Difference]: Finished difference Result 80572 states and 260596 transitions. [2019-12-27 04:59:26,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:59:26,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 04:59:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:26,805 INFO L225 Difference]: With dead ends: 80572 [2019-12-27 04:59:26,805 INFO L226 Difference]: Without dead ends: 80558 [2019-12-27 04:59:26,806 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-27 04:59:27,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80558 states. [2019-12-27 04:59:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80558 to 61629. [2019-12-27 04:59:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61629 states. [2019-12-27 04:59:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61629 states to 61629 states and 203651 transitions. [2019-12-27 04:59:28,726 INFO L78 Accepts]: Start accepts. Automaton has 61629 states and 203651 transitions. Word has length 20 [2019-12-27 04:59:28,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:28,726 INFO L462 AbstractCegarLoop]: Abstraction has 61629 states and 203651 transitions. [2019-12-27 04:59:28,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:59:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 61629 states and 203651 transitions. [2019-12-27 04:59:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:59:28,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:28,743 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-27 04:59:28,743 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:28,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:28,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2089011230, now seen corresponding path program 1 times [2019-12-27 04:59:28,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:28,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520823064] [2019-12-27 04:59:28,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:28,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520823064] [2019-12-27 04:59:28,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:28,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:28,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235887931] [2019-12-27 04:59:28,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:59:28,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:28,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:59:28,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:59:28,814 INFO L87 Difference]: Start difference. First operand 61629 states and 203651 transitions. Second operand 4 states. [2019-12-27 04:59:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:28,898 INFO L93 Difference]: Finished difference Result 11937 states and 32068 transitions. [2019-12-27 04:59:28,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:59:28,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 04:59:28,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:28,912 INFO L225 Difference]: With dead ends: 11937 [2019-12-27 04:59:28,912 INFO L226 Difference]: Without dead ends: 7333 [2019-12-27 04:59:28,914 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-27 04:59:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7333 states. [2019-12-27 04:59:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7333 to 7293. [2019-12-27 04:59:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7293 states. [2019-12-27 04:59:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7293 states to 7293 states and 16943 transitions. [2019-12-27 04:59:29,036 INFO L78 Accepts]: Start accepts. Automaton has 7293 states and 16943 transitions. Word has length 23 [2019-12-27 04:59:29,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:29,038 INFO L462 AbstractCegarLoop]: Abstraction has 7293 states and 16943 transitions. [2019-12-27 04:59:29,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:59:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 7293 states and 16943 transitions. [2019-12-27 04:59:29,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 04:59:29,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:29,045 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-27 04:59:29,047 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:29,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:29,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1983201381, now seen corresponding path program 1 times [2019-12-27 04:59:29,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:29,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334163452] [2019-12-27 04:59:29,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:29,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334163452] [2019-12-27 04:59:29,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:29,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:29,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076202472] [2019-12-27 04:59:29,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:59:29,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:29,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:59:29,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:29,120 INFO L87 Difference]: Start difference. First operand 7293 states and 16943 transitions. Second operand 3 states. [2019-12-27 04:59:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:29,204 INFO L93 Difference]: Finished difference Result 7826 states and 17221 transitions. [2019-12-27 04:59:29,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:59:29,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-27 04:59:29,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:29,215 INFO L225 Difference]: With dead ends: 7826 [2019-12-27 04:59:29,215 INFO L226 Difference]: Without dead ends: 7826 [2019-12-27 04:59:29,216 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-27 04:59:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7826 states. [2019-12-27 04:59:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7826 to 7274. [2019-12-27 04:59:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7274 states. [2019-12-27 04:59:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7274 states to 7274 states and 16073 transitions. [2019-12-27 04:59:29,301 INFO L78 Accepts]: Start accepts. Automaton has 7274 states and 16073 transitions. Word has length 31 [2019-12-27 04:59:29,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:29,301 INFO L462 AbstractCegarLoop]: Abstraction has 7274 states and 16073 transitions. [2019-12-27 04:59:29,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:59:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 7274 states and 16073 transitions. [2019-12-27 04:59:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 04:59:29,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:29,308 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-27 04:59:29,308 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:29,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1139326676, now seen corresponding path program 1 times [2019-12-27 04:59:29,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:29,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892341021] [2019-12-27 04:59:29,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:29,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892341021] [2019-12-27 04:59:29,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:29,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:29,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524105745] [2019-12-27 04:59:29,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:59:29,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:29,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:59:29,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:59:29,410 INFO L87 Difference]: Start difference. First operand 7274 states and 16073 transitions. Second operand 5 states. [2019-12-27 04:59:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:29,828 INFO L93 Difference]: Finished difference Result 8157 states and 17754 transitions. [2019-12-27 04:59:29,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:59:29,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-27 04:59:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:29,838 INFO L225 Difference]: With dead ends: 8157 [2019-12-27 04:59:29,839 INFO L226 Difference]: Without dead ends: 8156 [2019-12-27 04:59:29,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:59:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8156 states. [2019-12-27 04:59:29,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8156 to 6435. [2019-12-27 04:59:29,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6435 states. [2019-12-27 04:59:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6435 states to 6435 states and 14377 transitions. [2019-12-27 04:59:29,916 INFO L78 Accepts]: Start accepts. Automaton has 6435 states and 14377 transitions. Word has length 34 [2019-12-27 04:59:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:29,916 INFO L462 AbstractCegarLoop]: Abstraction has 6435 states and 14377 transitions. [2019-12-27 04:59:29,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:59:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 6435 states and 14377 transitions. [2019-12-27 04:59:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 04:59:29,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:29,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:29,924 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:29,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:29,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1938289387, now seen corresponding path program 1 times [2019-12-27 04:59:29,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:29,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849052501] [2019-12-27 04:59:29,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:29,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849052501] [2019-12-27 04:59:29,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:29,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:29,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062459465] [2019-12-27 04:59:29,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:59:29,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:29,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:59:29,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:59:29,985 INFO L87 Difference]: Start difference. First operand 6435 states and 14377 transitions. Second operand 4 states. [2019-12-27 04:59:30,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:30,018 INFO L93 Difference]: Finished difference Result 7442 states and 16589 transitions. [2019-12-27 04:59:30,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:59:30,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 04:59:30,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:30,025 INFO L225 Difference]: With dead ends: 7442 [2019-12-27 04:59:30,025 INFO L226 Difference]: Without dead ends: 5411 [2019-12-27 04:59:30,025 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-27 04:59:30,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5411 states. [2019-12-27 04:59:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5411 to 5391. [2019-12-27 04:59:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5391 states. [2019-12-27 04:59:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5391 states to 5391 states and 11990 transitions. [2019-12-27 04:59:30,085 INFO L78 Accepts]: Start accepts. Automaton has 5391 states and 11990 transitions. Word has length 42 [2019-12-27 04:59:30,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:30,085 INFO L462 AbstractCegarLoop]: Abstraction has 5391 states and 11990 transitions. [2019-12-27 04:59:30,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:59:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 5391 states and 11990 transitions. [2019-12-27 04:59:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 04:59:30,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:30,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:30,094 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:30,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:30,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1246920481, now seen corresponding path program 2 times [2019-12-27 04:59:30,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:30,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005669071] [2019-12-27 04:59:30,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:30,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005669071] [2019-12-27 04:59:30,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:30,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:30,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370709174] [2019-12-27 04:59:30,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:59:30,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:30,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:59:30,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:59:30,192 INFO L87 Difference]: Start difference. First operand 5391 states and 11990 transitions. Second operand 5 states. [2019-12-27 04:59:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:30,318 INFO L93 Difference]: Finished difference Result 8194 states and 18253 transitions. [2019-12-27 04:59:30,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:59:30,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 04:59:30,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:30,327 INFO L225 Difference]: With dead ends: 8194 [2019-12-27 04:59:30,327 INFO L226 Difference]: Without dead ends: 6622 [2019-12-27 04:59:30,328 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-27 04:59:30,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6622 states. [2019-12-27 04:59:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6622 to 6622. [2019-12-27 04:59:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6622 states. [2019-12-27 04:59:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6622 states to 6622 states and 14891 transitions. [2019-12-27 04:59:30,401 INFO L78 Accepts]: Start accepts. Automaton has 6622 states and 14891 transitions. Word has length 42 [2019-12-27 04:59:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:30,401 INFO L462 AbstractCegarLoop]: Abstraction has 6622 states and 14891 transitions. [2019-12-27 04:59:30,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:59:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6622 states and 14891 transitions. [2019-12-27 04:59:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 04:59:30,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:30,408 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-27 04:59:30,408 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:30,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2045858329, now seen corresponding path program 1 times [2019-12-27 04:59:30,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:30,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285595982] [2019-12-27 04:59:30,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:30,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285595982] [2019-12-27 04:59:30,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:30,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:59:30,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047998871] [2019-12-27 04:59:30,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:59:30,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:30,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:59:30,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:59:30,489 INFO L87 Difference]: Start difference. First operand 6622 states and 14891 transitions. Second operand 5 states. [2019-12-27 04:59:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:31,020 INFO L93 Difference]: Finished difference Result 7360 states and 16386 transitions. [2019-12-27 04:59:31,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:59:31,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 04:59:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:31,031 INFO L225 Difference]: With dead ends: 7360 [2019-12-27 04:59:31,031 INFO L226 Difference]: Without dead ends: 7360 [2019-12-27 04:59:31,032 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-27 04:59:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2019-12-27 04:59:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 7160. [2019-12-27 04:59:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7160 states. [2019-12-27 04:59:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7160 states to 7160 states and 16003 transitions. [2019-12-27 04:59:31,122 INFO L78 Accepts]: Start accepts. Automaton has 7160 states and 16003 transitions. Word has length 43 [2019-12-27 04:59:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:31,123 INFO L462 AbstractCegarLoop]: Abstraction has 7160 states and 16003 transitions. [2019-12-27 04:59:31,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:59:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 7160 states and 16003 transitions. [2019-12-27 04:59:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 04:59:31,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:31,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:31,131 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:31,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:31,132 INFO L82 PathProgramCache]: Analyzing trace with hash -985992108, now seen corresponding path program 1 times [2019-12-27 04:59:31,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:31,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219831399] [2019-12-27 04:59:31,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:31,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219831399] [2019-12-27 04:59:31,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:31,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:59:31,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086755805] [2019-12-27 04:59:31,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:59:31,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:31,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:59:31,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:59:31,222 INFO L87 Difference]: Start difference. First operand 7160 states and 16003 transitions. Second operand 5 states. [2019-12-27 04:59:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:31,279 INFO L93 Difference]: Finished difference Result 5274 states and 11717 transitions. [2019-12-27 04:59:31,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:59:31,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 04:59:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:31,281 INFO L225 Difference]: With dead ends: 5274 [2019-12-27 04:59:31,282 INFO L226 Difference]: Without dead ends: 917 [2019-12-27 04:59:31,282 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-27 04:59:31,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-12-27 04:59:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 875. [2019-12-27 04:59:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-12-27 04:59:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1764 transitions. [2019-12-27 04:59:31,299 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1764 transitions. Word has length 44 [2019-12-27 04:59:31,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:31,300 INFO L462 AbstractCegarLoop]: Abstraction has 875 states and 1764 transitions. [2019-12-27 04:59:31,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:59:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1764 transitions. [2019-12-27 04:59:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 04:59:31,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:31,303 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-27 04:59:31,303 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:31,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:31,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1013481127, now seen corresponding path program 1 times [2019-12-27 04:59:31,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:31,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445183208] [2019-12-27 04:59:31,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:31,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445183208] [2019-12-27 04:59:31,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:31,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:59:31,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676391313] [2019-12-27 04:59:31,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:59:31,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:31,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:59:31,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:59:31,564 INFO L87 Difference]: Start difference. First operand 875 states and 1764 transitions. Second operand 8 states. [2019-12-27 04:59:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:31,859 INFO L93 Difference]: Finished difference Result 1602 states and 3203 transitions. [2019-12-27 04:59:31,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:59:31,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-27 04:59:31,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:31,861 INFO L225 Difference]: With dead ends: 1602 [2019-12-27 04:59:31,861 INFO L226 Difference]: Without dead ends: 1119 [2019-12-27 04:59:31,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:59:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-12-27 04:59:31,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 931. [2019-12-27 04:59:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-27 04:59:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1858 transitions. [2019-12-27 04:59:31,877 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1858 transitions. Word has length 59 [2019-12-27 04:59:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:31,878 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1858 transitions. [2019-12-27 04:59:31,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:59:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1858 transitions. [2019-12-27 04:59:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 04:59:31,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:31,880 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-27 04:59:31,880 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:31,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:31,881 INFO L82 PathProgramCache]: Analyzing trace with hash 411755865, now seen corresponding path program 2 times [2019-12-27 04:59:31,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:31,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504737323] [2019-12-27 04:59:31,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:31,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504737323] [2019-12-27 04:59:31,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:31,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:59:31,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888036191] [2019-12-27 04:59:31,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:59:31,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:31,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:59:31,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:59:31,988 INFO L87 Difference]: Start difference. First operand 931 states and 1858 transitions. Second operand 6 states. [2019-12-27 04:59:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:32,447 INFO L93 Difference]: Finished difference Result 1059 states and 2089 transitions. [2019-12-27 04:59:32,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:59:32,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 04:59:32,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:32,449 INFO L225 Difference]: With dead ends: 1059 [2019-12-27 04:59:32,449 INFO L226 Difference]: Without dead ends: 1059 [2019-12-27 04:59:32,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-27 04:59:32,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2019-12-27 04:59:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 961. [2019-12-27 04:59:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-12-27 04:59:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1913 transitions. [2019-12-27 04:59:32,460 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1913 transitions. Word has length 59 [2019-12-27 04:59:32,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:32,460 INFO L462 AbstractCegarLoop]: Abstraction has 961 states and 1913 transitions. [2019-12-27 04:59:32,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:59:32,461 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1913 transitions. [2019-12-27 04:59:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 04:59:32,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:32,463 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-27 04:59:32,463 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:32,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:32,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2044824263, now seen corresponding path program 3 times [2019-12-27 04:59:32,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:32,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168963454] [2019-12-27 04:59:32,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:32,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168963454] [2019-12-27 04:59:32,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:32,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:59:32,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850615050] [2019-12-27 04:59:32,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:59:32,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:32,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:59:32,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:32,547 INFO L87 Difference]: Start difference. First operand 961 states and 1913 transitions. Second operand 3 states. [2019-12-27 04:59:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:32,560 INFO L93 Difference]: Finished difference Result 961 states and 1912 transitions. [2019-12-27 04:59:32,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:59:32,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 04:59:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:32,561 INFO L225 Difference]: With dead ends: 961 [2019-12-27 04:59:32,562 INFO L226 Difference]: Without dead ends: 961 [2019-12-27 04:59:32,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-12-27 04:59:32,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 816. [2019-12-27 04:59:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-12-27 04:59:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1647 transitions. [2019-12-27 04:59:32,573 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1647 transitions. Word has length 59 [2019-12-27 04:59:32,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:32,573 INFO L462 AbstractCegarLoop]: Abstraction has 816 states and 1647 transitions. [2019-12-27 04:59:32,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:59:32,574 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1647 transitions. [2019-12-27 04:59:32,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 04:59:32,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:32,575 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-27 04:59:32,576 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:32,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:32,576 INFO L82 PathProgramCache]: Analyzing trace with hash -103560940, now seen corresponding path program 1 times [2019-12-27 04:59:32,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:32,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280844527] [2019-12-27 04:59:32,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:59:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:59:32,706 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:59:32,706 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:59:32,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_45| 0 0))) (and (= 0 v_~x$w_buff0_used~0_130) (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$w_buff1_used~0_66 0) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$w_buff1~0_33) (= 0 v_~x$r_buff0_thd0~0_22) (= |v_ULTIMATE.start_main_~#t0~0.offset_17| 0) (= v_~x$flush_delayed~0_17 0) (= v_~x$r_buff1_thd2~0_35 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t0~0.base_21| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t0~0.base_21|) |v_ULTIMATE.start_main_~#t0~0.offset_17| 0)) |v_#memory_int_15|) (= |v_#valid_43| (store .cse0 |v_ULTIMATE.start_main_~#t0~0.base_21| 1)) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$r_buff0_thd1~0_53) (= (select .cse0 |v_ULTIMATE.start_main_~#t0~0.base_21|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t0~0.base_21| 4)) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= v_~x~0_31 0) (= v_~x$mem_tmp~0_12 0) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~y~0_8) (= |v_#NULL.offset_4| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t0~0.base_21|) (= v_~x$r_buff1_thd0~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_17) (= v_~x$r_buff1_thd1~0_27 0) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p0_EBX~0_16 0) (= 0 v_~x$w_buff0~0_35) (= 0 v_~x$r_buff0_thd2~0_75) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_12, ULTIMATE.start_main_~#t0~0.offset=|v_ULTIMATE.start_main_~#t0~0.offset_17|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, #length=|v_#length_17|, ~y~0=v_~y~0_8, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_12|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_66, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_35, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_24, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_75, ULTIMATE.start_main_~#t0~0.base=|v_ULTIMATE.start_main_~#t0~0.base_21|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_24|, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_18|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_15|, ~x~0=v_~x~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_6} 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_~#t0~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_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_~#t0~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_~#t1~0.base, ~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, ~__unbuffered_cnt~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1~0.offset, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 04:59:32,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1~0.base_12|) (= |v_ULTIMATE.start_main_~#t1~0.offset_10| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0.base_12| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_12| 1)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0.base_12|) |v_ULTIMATE.start_main_~#t1~0.offset_10| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1~0.offset] because there is no mapped edge [2019-12-27 04:59:32,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_22 v_~x$w_buff1~0_24) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= 1 v_~x$w_buff0~0_21) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_~x$w_buff1_used~0_53 v_~x$w_buff0_used~0_98) (= 1 v_~x$w_buff0_used~0_97) (= (mod v_~x$w_buff1_used~0_53 256) 0) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~x$w_buff1~0=v_~x$w_buff1~0_24, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} 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-27 04:59:32,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L775-2-->L775-4: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In760524735 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In760524735 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1~0_In760524735 |P1Thread1of1ForFork1_#t~ite28_Out760524735|)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out760524735| ~x$w_buff0~0_In760524735)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In760524735, ~x$w_buff1~0=~x$w_buff1~0_In760524735, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In760524735, ~x$w_buff0_used~0=~x$w_buff0_used~0_In760524735} OutVars{~x$w_buff0~0=~x$w_buff0~0_In760524735, ~x$w_buff1~0=~x$w_buff1~0_In760524735, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In760524735, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out760524735|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In760524735} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 04:59:32,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L775-4-->L776: Formula: (= v_~x~0_20 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_7|, ~x~0=v_~x~0_20, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 04:59:32,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~x$r_buff0_thd2~0_54 v_~x$r_buff0_thd2~0_53)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 04:59:32,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In761932226 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite48_Out761932226| ~x$mem_tmp~0_In761932226) (not .cse0)) (and (= ~x~0_In761932226 |P1Thread1of1ForFork1_#t~ite48_Out761932226|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In761932226, ~x$mem_tmp~0=~x$mem_tmp~0_In761932226, ~x~0=~x~0_In761932226} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In761932226, ~x$mem_tmp~0=~x$mem_tmp~0_In761932226, ~x~0=~x~0_In761932226, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out761932226|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 04:59:32,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1547607247 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1547607247 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out1547607247| ~x$w_buff0_used~0_In1547607247)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite51_Out1547607247| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1547607247, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1547607247} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out1547607247|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1547607247, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1547607247} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 04:59:32,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In815122815 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In815122815 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In815122815 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In815122815 256) 0))) (or (and (= ~x$w_buff1_used~0_In815122815 |P1Thread1of1ForFork1_#t~ite52_Out815122815|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite52_Out815122815|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In815122815, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In815122815, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In815122815, ~x$w_buff0_used~0=~x$w_buff0_used~0_In815122815} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out815122815|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In815122815, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In815122815, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In815122815, ~x$w_buff0_used~0=~x$w_buff0_used~0_In815122815} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 04:59:32,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1067636860 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1067636860 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-1067636860 ~x$r_buff0_thd2~0_In-1067636860)) (and (= ~x$r_buff0_thd2~0_Out-1067636860 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1067636860, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1067636860} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1067636860|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1067636860, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1067636860} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 04:59:32,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L794-->L794-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In579554710 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In579554710 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In579554710 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In579554710 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In579554710 |P1Thread1of1ForFork1_#t~ite54_Out579554710|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite54_Out579554710| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In579554710, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In579554710, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In579554710, ~x$w_buff0_used~0=~x$w_buff0_used~0_In579554710} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In579554710, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In579554710, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out579554710|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In579554710, ~x$w_buff0_used~0=~x$w_buff0_used~0_In579554710} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 04:59:32,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_31 |v_P1Thread1of1ForFork1_#t~ite54_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_31, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_7|, 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-27 04:59:32,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1208811252 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out-1208811252| ~x~0_In-1208811252) .cse0) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out-1208811252| ~x$mem_tmp~0_In-1208811252)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1208811252, ~x$mem_tmp~0=~x$mem_tmp~0_In-1208811252, ~x~0=~x~0_In-1208811252} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-1208811252|, ~x$flush_delayed~0=~x$flush_delayed~0_In-1208811252, ~x$mem_tmp~0=~x$mem_tmp~0_In-1208811252, ~x~0=~x~0_In-1208811252} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 04:59:32,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L747-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x~0_26 |v_P0Thread1of1ForFork0_#t~ite25_8|) (= v_~x$flush_delayed~0_12 0) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x~0=v_~x~0_26} 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-27 04:59:32,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L819-->L821-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_106 256) 0) (= 0 (mod v_~x$r_buff0_thd0~0_16 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 04:59:32,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L821-2-->L821-5: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1418787459 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1418787459 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite58_Out-1418787459| |ULTIMATE.start_main_#t~ite57_Out-1418787459|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite57_Out-1418787459| ~x$w_buff1~0_In-1418787459) (not .cse2)) (and (or .cse0 .cse2) .cse1 (= |ULTIMATE.start_main_#t~ite57_Out-1418787459| ~x~0_In-1418787459)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1418787459, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1418787459, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1418787459, ~x~0=~x~0_In-1418787459} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1418787459, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1418787459|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1418787459|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1418787459, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1418787459, ~x~0=~x~0_In-1418787459} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 04:59:32,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1884271487 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1884271487 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-1884271487| 0)) (and (= |ULTIMATE.start_main_#t~ite59_Out-1884271487| ~x$w_buff0_used~0_In-1884271487) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1884271487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1884271487} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1884271487, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1884271487|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1884271487} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 04:59:32,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2021046123 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2021046123 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-2021046123 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-2021046123 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-2021046123|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-2021046123 |ULTIMATE.start_main_#t~ite60_Out-2021046123|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2021046123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2021046123, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2021046123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2021046123} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2021046123, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-2021046123|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2021046123, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2021046123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2021046123} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 04:59:32,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-142583469 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-142583469 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-142583469| 0)) (and (= |ULTIMATE.start_main_#t~ite61_Out-142583469| ~x$r_buff0_thd0~0_In-142583469) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-142583469, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-142583469} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-142583469, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-142583469|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-142583469} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 04:59:32,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1081738187 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1081738187 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1081738187 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1081738187 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1081738187| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite62_Out-1081738187| ~x$r_buff1_thd0~0_In-1081738187) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1081738187, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1081738187, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1081738187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1081738187} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1081738187|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1081738187, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1081738187, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1081738187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1081738187} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 04:59:32,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_~main$tmp_guard1~0_8 0) (= 1 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p0_EAX~0_7 1) (= v_~x$r_buff1_thd0~0_16 |v_ULTIMATE.start_main_#t~ite62_12|)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} 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-27 04:59:32,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:59:32 BasicIcfg [2019-12-27 04:59:32,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:59:32,884 INFO L168 Benchmark]: Toolchain (without parser) took 41007.85 ms. Allocated memory was 147.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 102.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 560.1 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:32,885 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 147.3 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 04:59:32,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 736.81 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 102.1 MB in the beginning and 158.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:32,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.89 ms. Allocated memory is still 204.5 MB. Free memory was 158.4 MB in the beginning and 155.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:32,887 INFO L168 Benchmark]: Boogie Preprocessor took 44.05 ms. Allocated memory is still 204.5 MB. Free memory was 155.2 MB in the beginning and 152.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:32,887 INFO L168 Benchmark]: RCFGBuilder took 910.32 ms. Allocated memory is still 204.5 MB. Free memory was 152.7 MB in the beginning and 99.8 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:32,888 INFO L168 Benchmark]: TraceAbstraction took 39232.53 ms. Allocated memory was 204.5 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 99.2 MB in the beginning and 1.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 499.6 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:32,891 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.45 ms. Allocated memory is still 147.3 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 736.81 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 102.1 MB in the beginning and 158.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.89 ms. Allocated memory is still 204.5 MB. Free memory was 158.4 MB in the beginning and 155.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.05 ms. Allocated memory is still 204.5 MB. Free memory was 155.2 MB in the beginning and 152.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 910.32 ms. Allocated memory is still 204.5 MB. Free memory was 152.7 MB in the beginning and 99.8 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39232.53 ms. Allocated memory was 204.5 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 99.2 MB in the beginning and 1.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 499.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 179 ProgramPointsBefore, 107 ProgramPointsAfterwards, 228 TransitionsBefore, 132 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 50 ConcurrentYvCompositions, 27 ChoiceCompositions, 8706 VarBasedMoverChecksPositive, 225 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 130993 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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] [L815] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L775] 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_p0_EBX=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] [L776] 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_p0_EBX=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$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)) [L777] 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_p0_EBX=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] [L777] 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)) [L778] 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_p0_EBX=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] [L778] 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)) [L779] 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_p0_EBX=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] [L779] 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)) [L781] 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_p0_EBX=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] [L781] 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)) [L782] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L790] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L729] 1 y = 1 [L732] 1 __unbuffered_p0_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L739] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L739] 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) [L740] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 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)) [L741] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 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)) [L742] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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))=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 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)) [L743] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L743] 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)) [L744] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 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)) [L745] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L745] 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)) [L746] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 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 [L824] 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, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 38.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3794 SDtfs, 3234 SDslu, 5749 SDs, 0 SdLazy, 2542 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61629occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 47923 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 611 NumberOfCodeBlocks, 611 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 58565 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...